This REAL exam and write your directions carefully an your work. $($But$,$ actually, you analysis: Consider the following pseudocode:

$(10$ points$)$ Algorithm analysis: Consider the following psendacode:Let T$($n$)$ denote the number of times Line $1$ is executed, where n is the length of the array Give an asymptotic expression $($i$.$e$.,$ using O$(*)$ notation$)$ for T$($n$)$ that is as simple as possib Justify your answer.