Consider the following code snippet with line numbers in red font color;

1. public static int myCount(int n){

2. int a, b;

3. a = 5;

4. b = 6;

5. a++;

6. b--;

7. int i, j, k, count = 0;

8. if (a <= b/2) {

9. for (i = 0; i <= n; i++)

10. count++;

11. }

12. else {

13. for (i = 0; i <= n; i++)

14. for (j = 0; j <= n; j++)

15. count++;

16. }

17. }

Calculate time complexity (with least upper bound) for different segments of the code by filling the following table.

Segments	Segment 1 (Line 2-7)	Segment 2 (Line 9-10 )	Segment 3 (Line 12-15)	Complete Method myCount()
Time Complexity
Reason