To find the greatest common divisor (GCD) or least common multiple (LCM) of two numbers, we can use the Euclidean algorithm.

To find the GCD of 130 and 26:
1. Divide 130 by 26: 130 ÷ 26 = 5 with a remainder of 0.
2. Since the remainder is 0, the GCD is 26.

To find the LCM of 130 and 26:
1. Divide 130 by the GCD (26): 130 ÷ 26 = 5.
2. Multiply the GCD (26) by the result: 26 × 5 = 130.
3. Therefore, the LCM is 130.

So, the answer is D) 130.