A. Implement a recursive algorithm (in either Python, Java, or C/C++) that takes as input three natural numbers a and r, and n, and outputs the sum of the first n terms in a geometric series: a, ar, ara, ar3,... More specifically, your algorithm should output: Sum = a + ar + ar? + + arn-1 B. Develop a simpler (non-recursive) algorithm for the same problem and use it to double check the results obtained above