3.6 Give an algorithm that computes in O(n logn) time a diagonal that splits a simple polygon with n vertices into two simple polygons each with at most [2n/3 +2 vertices. Hint: Use the dual graph of a triangulation