Q1. Find a generic polygon that can lead to the best case behavior in the Hertel-Mehlhorn algorithm with respect to the optimum: H-M produce 2r pieces, but +1 pieces are possible. (2 points) Q2. Specify the worst case for the gift wrapping algorithm, i.e. a set of N points such that the algorithm gives the worst time complexity as function of N. (1 point) Q1. Find a generic polygon that can lead to the best case behavior in the Hertel-Mehlhorn algorithm with respect to the optimum: H-M produce 2r pieces, but +1 pieces are possible. (2 points) Q2. Specify the worst case for the gift wrapping algorithm, i.e. a set of N points such that the algorithm gives the worst time complexity as function of N. (1 point)