resolve the following problem and show the work step by step

Consider the following algorithm Procedure quizzy (n : integer) t:= 0 for i : = 1 to n - 2 j := n while j # 1 t : = tti+j j := [3] return t. (1) Describe all the steps and values of the variables i, j, t, when the algorithm gets input n = 4. (2) What is the complexity of this algorithm? (3) Extra credit 1.5pt: Is this algorithm tractable or intractable