Computer Science - Algorithms - Divide and conquer - D&C Problem Solving

P1: 'Maximum element using D&C' → def find_max(arr, lo, hi): if lo == hi: return arr[lo]; mid = (lo+hi)//2; left_max = find_max(arr, lo, ___); right_max = find_max(arr, ___+1, hi); return max(left_max, right_max) [mid, mid]. P2: 'Power function O(log n)' → def power(x, n): if n==0: return 1; half =