please give me the copy and paste version as well

Your friends have been studying the closing prices of tech stocks, looking for interesting patterns. They've defined something called a rising trend, as follows. They have the closing price for a given stock recorded for n days in succession; let these prices be denoted P[1], P[2], ..., P[n]. A rising trend in these prices is a subsequence of the prices P[i_1], P[i_2], ..., P[i_k], for days i_1 P[i| then Set i = j. Add 1 to L. Endif Endfor In your example, give the actual length of the longest rising trend, and say what the algorithm above returns. (b) Give an efficient algorithm that takes a sequence of prices P[1], P[2], ..., P[n] and returns the length of the longest rising trend