An algorithm prints the following pattern: tE i. What are the basic operations performed by the algorithm that you would count toward its running time? ii. Count the number of these basic operations ii. The number of lines printed in the preceding pattern is five. Assume that the algorithm can extend this pattern for any number of lines (line number k has k stars). If the number of lines, n, is an input to the algorithm, how many basic operations are performed as a function of n? Write you answer to the above question as a big O order iv