<prompt> Create an algorithm to find the longest continuous increasing subarray in a given array.1, 2, 3, 4, 5, 6  <response>: Heres an algorithm to find the longest continuous increasing subarray in a given array:pythondef longestContinuousIncreasingSubarrayarr: n lenarr result 1 length 1 for i in range1, n: if arri arri-1: length 1 else: result maxresult, length length 1 return maxresult, lengtharr 1, 2, 3, 4, 5, 6printlongestContinuousIncreasingSubarrayarr Output:6In the above example, the entire array is increasing continuously, hence the length of the longest continuous increasing subarray is 6. 