Question 1. (20 points) Suppose the input to Graham's scan algorithm for convex hull are the points in the figure on the next page. Write down the sequence of push and pop operations that take place on the (initially empty) auxiliary stack, as the algorithm executes (so your answer is a sequence of statements like Push(p) or Pop(q)). Question 1. (20 points) Suppose the input to Graham's scan algorithm for convex hull are the points in the figure on the next page. Write down the sequence of push and pop operations that take place on the (initially empty) auxiliary stack, as the algorithm executes (so your answer is a sequence of statements like Push(p) or Pop(q))