Please help

5. What are the time complexity and big O notation (which requires justification) of the following code (each part of the code marked by blue takes one unit of time): 5.1 (7 points) int a = 0; for (int i = 0; i i; j--) { a = a + i + j; } } 5.2 (5 points) int a = 0; int i = n; while (i > 0) { a += 1; i = 2; }