Using C

Q8 Write a RECURSIVE version of BINARY SEARCH algorithm that does the following: i) Declares and initializes an array of pointers to hold the names of 10 different students in an alphabetical order as follows: char * ArraylD[ARRSIZE] {"Alia","Bea,"Che","Derick","Elena","Fatma","Giun","Henry","Ina","Jaden"J ii)Accepts a search target name from the user iii Compare the name inputted by the users with those in the list using binary search iv) Ifthe user provided number is present in the array, print: The index of the target name is index value. v) Output the left, middle, and right index for every iteration of the search vi Prints an output in the following format