. Run the Graham scan algorithm to compute the convex hull of the following set of points:

{ (6, 3), (5, 6), (8, 2), (2, 4), (3, 9), (1, 1), (1, 6) }

Use (1, 1) as the base pointit has the minimum y-coordinate. List the points that appear on the trial hull after each point is considered, in the order that they appear.

Warning: Be careful with (5, 6). (30 Points)