Enhance the algorithm discussed in class to determine the longest sub sequence in an array of integers even if the array is not unique (i.e., has duplicate integers). Your algorithm should identify unique sub sequences of length greater than one even if the array has duplicate integers. You could use additional memory (that could even grow with the input size), if needed. (1) Show the working (in paper, scan and upload as part of the PDF submission) of your enhanced algorithm on an array of 10-15 elements in which there is at least one sub sequence of length greater that one and there exists multiple occurrences of at least two integers in the array. Screenshots will not be accepted for this task.