undefined

8. (8 points) You are given two sequences, (a1, 22, ..., An) and (b1,b2, ..., bn), where each sequence consists of distinct integers. Describe a linear time algorithm (in the average case) that tests if a sequence is a permutation of the other. Assume that the simple uniform hashing assump- tion holds. Explain the running time of your algorithm. 9. (12 points) Consider again the previous problem but now allowing both the input sequences to have repeated integers. Modify your algorithm so that it also works in this case