You are given three sorted sequences X$,$ Y and Z of$$ $n$**2$$$,$ $n$**3$$ and $$\backslash$lg$\{$n$\}$$ comparable keys. We would like to find their common elements i$.$e$.$ the intersection of X$,$Y$,$ Z $($denoted in math as X$$Y$$Z $)$ and after doing so to print those common elements. Give the running time a time efficient approach to solve this problem. Provide an asymptotic tight bound.