Consider the algorithm that takes an input n and runs the following pseudocode: for i := 1 to n for j := 1 to i k := 4 · i · (j + 2) next j next i
(a) Given an input n, how many operations does this algorithm perform (as a function of n)?
(For our purposes, assume that iteration does not count as an operation; just multiplication, addition, and comparison.)
(b) What is the order of this algorithm?