Run the combine step of the divide-and-conquer algorithm for convex hull on the instance given below. You are given C = (P1, P10, P9, P3, P5) and C2 = (P8, P6, P4, P2, P7, P11). 1. Find the lowest point p* in C UC2. 2. Transform C into C so that points in C is sorted in increasing angle w.r.t. p*. 3. Partition C2 into two lists C2a and C26 so that each list is sorted in increasing angle w.r.t. p*. 4. Give list C by merging C2a and C26 so that each points in C is sorted in increasing angle w.r.t. p*. 5. Give list C' by merging C and C so that each points in C' is sorted in increasing angle w.r.t. p*. 6. Run Graham-Scan-Core algorithm to find convex hull of C'. Show stack operations at each step (to deal with each point). For example, you need to write like "For A: push A; pop B", which indicates when you process point A, push A into stack and also pop B out. P1 P8 P6 P4 P10 P11 P2 P9 P5 P7 P3 23 A G