4. Divide-and-Conquer is a 1. Top-Down approach 2. Bottom-Up approach 3. Memoized approach 4. Bottom-Top approach 5. What is a requirement of Binary Search? 1. The search must start at the beginning of the array 2. The search must start at the end of the array 3. The array must be sorted 4. The array cannot be sorted 6. What is the Maximum Subsequence Sum of the following? First Half Second Half 5, -3, 2,-6 -2, 3,7,-1 1. 14 2. 5 4. 6 5. 7