Question: 1. Given a sorted array, the goal is to find the smallest missing element in the array using Divide and Concur approach. All elements of

1. Given a sorted array, the goal is to find the smallest missing element in the array using Divide and Concur approach. All elements of the array are non-negative, and non-equivalent integers. [5 marks) 2. Solve 0-1 knapsack problem using dynamic programming. [10 marks]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
