1Select some 2D points and show the working procedure of Graham Scan algorithm to find the convex polygon. Clearly mention which points are in the stack after each iteration

5.Write down the truthfulness of the following statements a. Stack is the most commonly used data structure for implementing Dijkstras Algorithm? b. Dijkstras Algorithm cannot be applied on Unweighted graphs c. Every graph has only one minimum spanning tree. d. Consider a complete graph G with 4 vertices. The graph G has (4*2=8) spanning trees. e. Rabin and Karp Algorithm is String Matching Algorithm