The Union Find data type has a set of v vertices (0 to v-1) and two the operations union(v, w) and connected(v, w). The union(v, w) connects the two vertices v and w. The connected(v, w) returns true if the vertices v and w are connected, otherwise it returns false. Implement the Union Find data type as a C++ class. Demonstrate your implementation works on the set of 7 vertices (0 to 6) through testing the following commands.

connected(0, 3)

union(0, 3)

union(4, 6)

connected(0, 3)

connected(4, 3)

union(6, 0)

connected(4, 3)