Given a 8 x 8 mesh with eight faulty nodes (2,4), (2, 6), (3, 5), (3,3), (3,7), (4,4), (4,6), (5,5):

• Find all the faulty blocks based on two different definitions of safe/unsafe nodes.

• Find orthogonal convex polygons that cover all these faulty nodes based on the concept of enable/disable nodes.
• Find a set of disjoint orthogonal convex polygons that cover all these faulty nodes. In addition, the overall size of these orthogonal convex polygons is minimum.