Note: You should NOT write or use a computer program to answer any of these questions. If you do so, you will get ZERO for that question.

Q8: 10 pts) Consider the hash table-based algorithm (shown below) discussed in class to determine the longest contiguous subsequence of length greater than one in an array of integers. Algorithm Insert the elements of A in a hash table H Largest Length =1 for i=0 to n1 do if (A[i]1 is not in H) then j=A[i]//A[i] is the first element of a possible cont. sub seq. j=j+1 while (j is in H) do j=j+1 end while if (jA[i]>1) then // we have found a cont. sub seq. of length >1 Print all integers from A[i](j1) if (Largest Length 1) then // we have found a cont. sub seq. of length >1 Print all integers from A[i](j1) if (Largest Length