java

Bitonic Sequence is a sequence of numbers which is first strictly increasing then after a point strictly decreasing. The longest bitonic subarray problem is to find a subarray of a given sequence in which the subarrays elements are first sorted in in increasing order, then in decreasing order, and the subarray is as long as possible. Strictly ascending or descending subarrays are also accepted. For example, Longest Bitonic Subarray of sequence { 3, 5, 8, 4, 5, 9, 10, 8, 5, 3, 4 } is { 4, 5, 9, 10, 8, 5, 3 } For sequences sorted in increasing or decreasing order, the output is same as the input sequence. i.e. [1, 2, 3, 4, 5] > [1, 2, 3, 4, 5] OR [5, 4, 3, 2, 1] > [5, 4, 3, 2, 1] Write an algorithm to find the longest bitonic subarray, what is the time complexity for your algorithm