3 Running Time Complexity Following Segments Terms O Notation 10 Points Int 0 N Ali 1 True Q37080136

3. What is the running time complexity of the following segments in terms of O-notation. (10 points) (a) for (int i 0; i< n; i++) ali]-1; while( true) for (int i = 0; i < n, i++) for(int j = 0; j < i; j++) ali] aljl+i+j; (b) public int depth (Tree T, Position v) f // n denotes the total nodes of the tree if (T.isRoot(v)) return 0; else return 1+ depth (T,

OR

 

OR