This is discrete mathematics. Please 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.

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. for i from 2n1 to 2n +Inrn t2 then for j from Inn +1 to 3h +1 if 3 2 t3t +25 od else while 21 33 tt-Ini end while s2s +2n fi od