Given a group of characters a circular array A[ ]. It is required for each one to print the index of the first bigger character on its right. Print -1 if no one is bigger than it. Example 1: (refer to...

Extracted text: Given a group of characters a circular array A[ ]. It is required for each one to print the index of the first bigger character on its right. Print -1 if no one is bigger than it. Example 1: (refer to the figure below) A[]={L,B,Q,F,T,M} Output: 2 2 4 4 -1 2 Explanation of example 1: The given array A[] of character is as follows: A[index] A[0] A[1] A[2] A[3] | A[4] A[5] Content L В Q F M Example 2: A[]={J,P,S,D,N} Output: • Regarding "L", the first bigger character on its right is "Q" (i.e., A[2]), and hence 2 is printed. • Regarding “B" has also the same "Q" on her right, and hence 2 is printed again and so on. ... 1 2 -1 4 1 Describe how a brute-force approach algorithm would solve the above problem and explain its complexity Design a more efficient algorithm to solve this problem. [The efficiency of your algorithm is the main driver of solution], and analyze the complexity of your solution. Develop a python code to implement your efficient algorithm. Prepare a brief report comparing the two algorithms