Algorithm

I need complete ans for this

5. (25 points) You are given a circular sorted array A (of size n). You want to search for an element z to find the position of z in A (if exists). We assume A contains no duplicates and A is created by a rotation from a monotonically increasing array. Here, rotation means taking a suffix of sorted array A and moving to the front of A For example, let A [8,10, 11,2,4,5,6). If z 10, output 2 (note array position starts from 1); if 5, output 6, if 9, output-1 (i.e., z is not in A). Now your task is to design an efficient divide and conquer algorithm for this problem. a. (8 pts) Before giving the detailed algorithm, first tell me your high-level idea, including how to divide, conquer and combine subproblems. b. (1e pts) Write down the divide and conquer algorithm c. (5 pts) Analyze the running time