3. [9 points] The following can be solved greedily You have pictures to hang and hooks already in the wall to do so. The pictures are already setting along the wall. The further the hook is from a picture (any picture) the more time it will take. You want to hang the pictures in the least time. What picture takes the most time. Hint: sorting both lists and placing the picture on the nearest hook is the fastest route. [3 points] What is the optimal substructure? [3 points] What is the greedy property? [3 points] Prove correctness of your algorithm by proof of contradiction. a. b. c. 3. [9 points] The following can be solved greedily You have pictures to hang and hooks already in the wall to do so. The pictures are already setting along the wall. The further the hook is from a picture (any picture) the more time it will take. You want to hang the pictures in the least time. What picture takes the most time. Hint: sorting both lists and placing the picture on the nearest hook is the fastest route. [3 points] What is the optimal substructure? [3 points] What is the greedy property? [3 points] Prove correctness of your algorithm by proof of contradiction. a. b. c