2. Longest Increasing Sequence Write an assembly language subroutine that receives two input parameters: the offset of an array and the array’s size. It must return a count of the longest increasing sequence of integer values.

For example, in the following array, the longest strictly increasing sequence begins at index 3 and has a length of 4 { 14, 17, 26, 42 }:

[ -5, 10, 20, 14, 17, 26, 42, 22, 19, -5 ]

Call your subroutine from a C/C++ program that creates the array, passes the arguments, and prints the value returned by the subroutine.