) There are some people standing in a circle. You are given their heights in an a list of A[].It is required for each one to print the index of the first person taller than him on his right (print -1 if no one is taller than him). Example 2: List =[174,180,184,160,177] Output : 1 2 -1 4 1 Example 1 : List =[175,166,184,170,187,167] Output : 2 2 4 4 -1 0 Explanation of example 1: The given list A[] of heights is as follows: A[index] A[0] A[1] A[2] A[3] A[4] A[5] Content 175 166 184 170 187 167 The person at the starting point of the circle has a height 175. The first person taller than her on her right is 184 (i.e., A[2]). As It is required for each one to print the index of the first person taller than him on his right, 2 is printed. The second one with height 166 has also the same person on her right. Therefore 2 is printed again ... and so on Input list=[175,166,184,170,187,167] 1- Design an algorithm to solve this problem by using loop and if statement with providing full comments on the code. According the complexity which is covered in the TM111 chapter 6 you should make your algorithm efficient. 2- Explain the mechanism of your algorithm by your own words 3- Does your algorithm efficient or not (explain based on your answer)?

(( please I need the solve on OUBuild program)). Help me...