Problem $3.[10$ points$]$ Give the asymptotic running time of the following algorithm in $$

notation. Briefly justify your answer. Be sure to justify both the upper and the lower bound.

Func$1(n)$

slarr$0$;

ilarr$5$;

while $jlarri{i}^{3}logislarrs+1$;ilarri$4$