CommonElements. You are given three sorted sequences A,B,C of $n**2$, $n$ and $\lg{n}$ keys. We would like to find their common elements (i.e. intersection) and print them in the output. Give the running time of a time efficient approach to solve this problem. (We are only interested in the running time.)