<prompt> Orodha: 3, 2, 6, 4, 5, 1Kutokana na orodha ya integer, kupata ndefu zaidi kuongezeka subsequence.  <response>: The longest increasing subsequence of the given list 3, 2, 6, 4, 5, 1 is 2, 4, 5. Alternate version:A possible way to find the longest increasing subsequence of the given list would be to use dynamic programming. To do this, we first create a variable n which is the length of the given list. Then, we create an dp array of the same length as the list, and initialize it with all 1s, since each element is an increasing subsequence of length 1. We then loop through the list, comparing elements from left to right. If an element is found to be larger than the previous element and the dp value is smaller, we update the dp value by adding 1 to it. Finally, we return the maximum dp value.In Python, the code would look something like this:pythondef longest_increasing_subsequencelst: n lenlst dp 1 n for i in range1, n: for j in rangei: if lsti lstj and dpi dpj 1: dpi dpj 1 return maxdpresult longest_increasing_subsequence3, 2, 6, 4, 5, 1printresultThis would output 3, which is the length of the longest increasing subsequence: 2, 4, 5. 