II. ALGORITHM COMPLEXITY AND ASYMPTOTIC ANALYSIS The below visual representations of iterative looping structures are provided for Question 3 through Question 20. Algorithm 1 Algorithm 3 Algorithm 2 log.n 256 Algorithm 4 2 (10) Match one of our algorithms to the below code snippet. for (int i = 0; i < n; i++) { - for (int j=0; j < n; j++) { for (int k = 0; k < n; k++) { nop++; nop++; nop++; } for (int i = 0; i < n/2; i++) } nop++; a. Algorithm 1 b. Algorithm 2 c. Algorithm 3 d. Algorithm 4