When the size of the input is n, what function is the performance time of the following algorithm proportional to?

Please give me a brief explanation

sample (All, n) sum10: for i=1 to n sum1 - suml + A[i]; sum20; for i 1 to n for j1 ton sum2- sum2 + A[i] * Aljl: return suml + sum2: }