5. Consider the shape shown on the following graph and the brute force method of solving the convex hull problem 2 -2 -1 0 a. Label all the points that will be provided to the algorithm as input. You may print or redraw the graph and label the relevant points with alphabet letters. (3 points) b. State all the distinct line segments that will be identified and evaluated by the algorithm. You may use the labels from part a to identify the segments. (4 points) c. State the relevant matrixes, whose determinates will be evaluated, to show whether segment {(1,1),(2,2)) is on the convex hull. You do not need to calculate the determinates. Just show the matrixes. (4 points) d. Without completing the brute force algorithm, use your human perception to state the segments that make up the convex hull. (4 points)