Question

Answer all parts of the problem given in the .jpeg file below:

The impatient mover problem accepts an array of n positive integers, represent- ing the weights of boxes in an apartment and returns the maximum number of boxes that can be picked up in one pass through the apartment, given that you mav not select a box that is heavier than a box that has been chosen before it. For example, if the boxes were 29, 20, 30, 18, 35, 26, 28, 40, 8, and 39 lbs, the impatient mover could select a maximum of 4 boxes (29, 20, 18, and 8) in one pass. 1. Give pseudocode for a greedy (i.e., not dynamic programming) algorithm for the impatient mover problem 2. Prove that your greedy algorithm is not correct.

Answer 1