Analyze the time complexity of these code snippets: (1) Nested loops i=0..n, j=i..n, (2) Binary search, (3) Merge sort recurrence T(n)=2T(n/2)+O(n), (4) for(i=1; i<=n; i*=2), (5) Two-pointer sliding window, (6) Recursive Fibonacci without memoization. For each: give Big O, explain reasoning, and state if it would pass n=10^5 with 1 sec limit.
