3.1) a. sum = 0; for (int i = 0; i Implement loops a - fin Problem 3.1 and show heuristically that runtime grows according to Big-O for each set of loops.

3.1) a. sum = 0; for (int i = 0; i < n;="" i++)="" sum++;="" b.="" sum="0;" for="" (int="" i="0;" i="">< n;="" i++)="" for="" (int="" j="0;" j="">< n;="" j++)="" sum++;="" c.="" sum="0;" for="" (int="" i="0;" i="">< n;="" i++)="" for="" (int="" j="0;" j="">< n="" *="" n;="" j++)="" sum++;="" d.="" sum="0;" for="" (int="" i="0;" i="">< n;="" i++)="" for="" (int="" j="0;" j="">< i;="" j++)="" sum++;="" e.="" sum="" 0;="" for="" (int="" i="0;" i="">< n;="" i++)="" for="" (int="" j="0;" j="">< i="" *="" i;="" j++)="" for="" (int="" k="0;" k="">< j;="" k++)="">

Extracted text: Implement loops a - fin Problem 3.1 and show heuristically that runtime grows according to Big-O for each set of loops.