Analyze the following programs and show their time complexity functions and big-O notations. Show big-O proofs for problems 11, 13 and 15.

10. 13. for (i = 1; i 0; j 2) { // 5 assignment instructions // 2 assignments } } } for (k 1; k