COCS5313 Program-6A Due: 12/1/2009 Polygon Triangulation (Dynamic Programming) Consider the following 18 points in the 2-dimensional space: 0,100 100, 100 50, 100 200, 200 300, 200 350, 150 400, 100 440, 40 400, 0 350, -50 100, -50 200, -50 80, 50 90, 0 85, -5 150, 100 175, 125 250, 175 Task: Write a well-documented program that does: 1. Find all points not included in the Convex hull of these 18 points. 2. Print all points included in the Convex Hull starting with the leftmost (and topmost, if necessary) point, enumerating all these points in the clockwise order. 3. Find the minimum set of chords for the resulting hull and list all chords of the set, and 4. Print the minimum total length of these chords.