Consider a list of 8 floating-point numbers: a0, a1, . . ., a7, and its sum S computed as S = ((a0 + a1) + (a2 + a3)) + ((a4 + a5) + (a6 + a7)). Consider a list of n floating-point numbers where n can be any natural number. 1. In the recursive summation for n numbers, list the base case(s). 2. Describe in words the general case in the recursion. 3. Define a Python function to compute the sum of a list recursively