task5 java lang

> of 9 - 200M + Task 5. Big-O Notation (10 points) Estimate the big-O complexity for each of these algorithms, and justify your answer. To confirm your calculations, answers are provided at the end of the rubric. Your justification can be mathematical or written, formal or informal Problem Code fragment 3.1 int sun = 0; int j = 1; while (j = n) sun++ ) Big-o Category Justification (why did you pick the way you did?) 3.2 Sun) int sun for (int j in 1++) { if ( x 2 == 0){ sunt+s ) } Big. Category Justification (Why did you pick the way you did?) 3.3 int sum=; for (int i n. 2; 1++) { for (int jeli jen ++){ Sun) > Big- Category Justification (Why did you pick the way you did?) wa Labiles (1) zip WI Lab Files.zip wo3 Lab Linked L.docx A IMG-5642.jpg MG-3643.00 Show all X Par