5. (15%) Give an analysis for each of the following pseudo-code segments. You should evaluate the exact number of multiplications first and then determine the computational complexity in terms of the Big-O notation. Note: Consider only the number of multiplications (*). a) (5%) Sum = 0; for i=1 to N do { } for j=1 to N do { } } Sum - Sum+ (ij); b) (10%) Poly = 0; for i =N downto 0 do p=1; for j-1 to i do { p=px; Poly Poly + a[i] * power M