3. For the polygon below, find a bipartite graph whose independent sets describe non-touching sets of cuts between pairs of concave corners of the polygon, and use a maximum independent set in your graph to find the partition of the polygon into a minimum number of rectangles. 3. For the polygon below, find a bipartite graph whose independent sets describe non-touching sets of cuts between pairs of concave corners of the polygon, and use a maximum independent set in your graph to find the partition of the polygon into a minimum number of rectangles