Part $1($@$2$ points each$)$What is a tight upper bound $($big oh$)$ on the running time of the algorithm. Hint: You must say what n is in the Big Oh notation.Call the algorithm three times. For $($a$,$b$)=(4,20),(5,30)$ and $(40,100).$ Show the output for each run.Modify the algorithm to improve its big oh complexity $($i$..$e$,$ fewer basic steps are taken as the size of the input increases$).$ Show the improved algorithm.What is a tight upper bound $($big oh$)$ on the running time of the improved algorithm. Hint: You must say what n is in the Big Oh notation.Call the improved algorithm three times. For $($a$,$b$)=(4,20),(5,30)$ and $(40,100).$ Show the output for each run.