Algorithm AnalysisA unimodal sequence is a sequence for which there exists a t such that strictly increases and then strictly decreases, where the subscript calculations are performed modulo n. That is, if the sequence is rotated to the left t positions, it strictly increases to a maximum and then strictly decreases. An example of a unimodal sequence is given below. Design an efficient algorithm to find the maximum value in the unimodal sequence. You can assume that any input sequence to your algorithm is a unimodal sequence. (For a reduction of a letter grade on this problem, consider only unimodal sequences for which t = 0).