Consider the following program. Find T$($n$)$ for the algorithm $($count the number of primitive operations$)$ and then determine the tightest simplest expression for Big Oh that T$($n$)$ is in$.$

def func$($n$)$:

x $=1$

y $=1$

while x $<=$ n:

i $=0$

while i $<10$:

y $*=2$

i $+=1$

x $*=2$

return x $+$ y