Describe an O(n) algorithm that does the following: Given an input array of n integers lying in the range 0 .. 3n - 1, the algorithm outputs the first integer that occurs in the array only once. (You...

Extracted text: Describe an O(n) algorithm that does the following: Given an input array of n integers lying in the range 0 .. 3n - 1, the algorithm outputs the first integer that occurs in the array only once. (You may assume that each input array contains at least one number that has no duplicates in the array.) Explain why your algorithm has an O(n) running time. Example: If the input array is [1, 2, 4, 9, 3, 2, 1, 4, 5], then the return value is 9 since 9 is the first integer that occurs in the array only once. I