answers this question please I have 10 minuts

Part-B: Write a method that fills an array of n elements in a recursive manner Question III Linear Search (30 pts] Consider the following array composed of 10 elements: 2031 15 110 18 15 14 35 15 Suppose that we are doing a linear search to return the index of 15 if it exists. Write in detail the steps needed. What is the complexity of such algorithm? - Write a recursive method that linearly search an element in an array of size n and return the index of that element (if exist) and -1 otherwise. Search(int A[], int n, int element)