A subarray said to be strictly decreasing if its length is at least 2 and successive elemnet in the subarray, starting from the seond position, has a value strictly lesser than the proceding value. That is, for an integer array numbers[i]>numbers[j] foe every i = j-1\n\nConversely, a subarray said to be strictly increasing if its length is at least 2 and successive elemnet in the subarray, starting from the seond position, has a value strictly greater than the proceding value. That is, for an integer array numbers[i]<numbers[j] foe every i = j-1\n\nGiven an array of integers, if some subarray of length 0 or more is removed. Determine the longest subarray that is first strictly decreasing and then strictly increasing. for example, assume num=[2,4,6,8,7,8,9,6,6,8,9,7], removing the segment[5:7], i.e., 8,9,6. leaves te numbers, [2,4,6,8,7,6,8,9,7], so we have 8,7,6,8,9 is longest sequence with length 5. If no sequence found return 0. \ntest-1:\n20\n-49549\n90823\n-2150\n55520\n96107\n-44230\n-81998\n16642\n49608\n-19334\n96752\n64452\n80928\n67534\n-99164\n45668\n-37684\n-23363\n-61386\n90997\n\nExpected Output\n7

A subarray said to be strictly decreasing if its length is at least 2 and successive elemnet in the subarray, starting from the seond position, has a value stri