find an asymptotic running time of the following algorithms in notation

function func6(n) 2. for i 5n to 6n3 do 3, for j 5 to ido for k j to i do 6 7 8. endfor 9. return(s); endfor endfor 0.function func7(n) 2. i n; 3. while is n2 do 4 5.while /2 i do 6 7 8 9 10.endwhile 11.return(s i-floor(j/4): endwhile /* Note: division */ /* Note: addition */