Solve the following problems, showing any necessary work. 1. [5 points] Find the running time for the pseudocode shown below. Express your answer using big-O notation; that is, your answer should be O(g(n)), where g(n) grows as slowly as possible. S+0 t+0 s+2s+25 for i from n+1 to n² +1 j+1 do t+t-21 s3s 4 j+2j until Inj > n² st-s end for