6 Problem 6 - extra credit . Say that I have n objects, and I play a game where I repeatedly look at a random object. (Note: I don't throw away the objects I look at, so I might end up looking at the same object more than once.) In big-O notation, what is the expected number of objects I wil look at before I have seen every one of the n objects? You must show your work, as always. HINT 1 : You will want to use the formula that 1+1/2+1/3 + +1 O(log(n))