Given a stream of length n where every value is an integer lies in [1, N], show a single-pass algorithm that uses O(log n log N) memory and reports the elements such that (1) All elements that occur more than n/3 times in the stream are reported. (2) All elements that are reported at least n/6 times in the stream. Explain why your algorithm is correct.