Problem 4 (20 points). Given the following two convex polygons C1-(Pi,p2,p3,P,ps) and C2 (ps, p4,P6, p9,pi1,pi0), compute the convex hull of C1 UC2 using the linear time algorithm described within the divide-and-conquer algorithm for convex hull 1. Partition C2 into two sorted list, CyP and Cho, such that the points in each list are sorted w.r.t. 2. Give the merged list of C and C2oW, denoted as C2, such that all points in Ch are sorted w.r.t. 3. Give the merged list C2 and C1, denoted as C, such that all points in C are sorted w.r.t. the anchor 4. Run the Graham-Scan-Core algorithm with C as input: give the status of the stack as each point the anchor point pi in counter-clockwise order. the anchor point pi in counter-clockwise order. point pi in counter-clockwise order. in C gets processed. 9 Pa p5 P11 P10 P2 Pi Problem 4 (20 points). Given the following two convex polygons C1-(Pi,p2,p3,P,ps) and C2 (ps, p4,P6, p9,pi1,pi0), compute the convex hull of C1 UC2 using the linear time algorithm described within the divide-and-conquer algorithm for convex hull 1. Partition C2 into two sorted list, CyP and Cho, such that the points in each list are sorted w.r.t. 2. Give the merged list of C and C2oW, denoted as C2, such that all points in Ch are sorted w.r.t. 3. Give the merged list C2 and C1, denoted as C, such that all points in C are sorted w.r.t. the anchor 4. Run the Graham-Scan-Core algorithm with C as input: give the status of the stack as each point the anchor point pi in counter-clockwise order. the anchor point pi in counter-clockwise order. point pi in counter-clockwise order. in C gets processed. 9 Pa p5 P11 P10 P2 Pi