Consider the pseudocode in the code snippet attached

a$.$ Write an expression $($probably involving summations$)$ for how many

times the indicated line of code is executed as a function of n$.$ Simplify the expression into closed form $($no summation symbols$).$ Show all of your work.

b$.$ What is the big$-$Oh running time of the algorithm, as a function of n

$($bonus$)$c$.$ Write an expression $($probably involving summations$)$ for the value of the variable x $($as a function of n$)$ after executing the code? Simplify the expression into closed form. Show all of your work. $($Hint: this expression should be different from the one in part a

PLEASE SHOW ALL WORKS FOR PARTS A THROUGH C