a$)$ Modify the algorithm given at the Wednesday lecture to compute the length of

the longest increasing subsequence, where the consecutive values do not differ

by more than t$,$ where t $>0$ is a given parameter.

b$)$ Modify the traceback algorithm given at the Wednesday lecture $($and the routine calling it$)$ to extract all longest increasing subsequences.