needed program in python or c programming

the inputs for case1: 1 2 3 1 2 3

case 2: 5 6 4 4 2 1

case 3: 0 -1 2 0 -1 2 1 5 3 4 0 -1 0 2

case 4: 5 6 4 3 3 1 2 4 2 3 1 6 2 3

Write a program that implements Graham's algorithm for computing the convex hull of a set of points S in the plane. Your algorithm should take as input the coordinates of the points in S (following the format in the input files on D2L), and should output the coordinates of the points on the convex hull of S. You can assume that the points in S are distinct. For sorting the points, you need to code an O(n lg n)-time sorting algorithm. case5.txt UWP PW 26 10 12 62 75 4 1 82 12 1 14 5 3 12 17 2 ONO case6.txt 110 18 5 1 5 11 12 6 10 2 6 21 7 15 14 1 8 2 1 13 4 5 3 12 3 5 17 12 1 16 13 7 29 78