Computer Science - Algorithms - Merge sort - Merge Sort Practice

P1: 'Merge [1,4,7] and [2,5,8]' → Result: [1, ___, ___, ___, ___, ___] [2, 4, 5, 7, 8]. P2: 'Base case of merge sort' → if len(arr) <= ___: return arr [1]. P3: 'Split point' → mid = len(arr) // ___; left = arr[:mid]; right = arr[___:] [2, mid]. P4: 'In merge, when left list is exhausted' → result.ex