1. Write a recursive function CoconutSearch that takes three parameters: an array, starting position, and the number to search. It returns the location of a number if exists in the array, otherwise returns - 1. The function works as per the following recursive definition: - if e is at the location loc in the array then returns loc, - Otherwise, search again at loc+1 - If loc is greater than number of elements than returns - 1 def Coconut Search (array, loc, e): 1/ your code goes here Example: array = [1,2,3,4,5) print (Coconut Search (array, 0, 2)) print (Coconut Search(array, 0, 6)) #the function should return 1 -1 2. Write a function RotateLeft that rotates an array of size n to the left. The function takes two parameters an integer d which is the amount to rotate by and an array. The function should return the rotated array. def RotateLeft (array, d): // your code goes here Example: array - [1,2,3,4,5) d = 2 #two rotations print (RotateLeft (array,d)) #the function should return [3,4,5,1,2]