Attached file disjoint-set.cpp:

#include

using namespace std;

void make_set(int p[], int x){ p[x] = x; cout

int find_set(int p[], int x){ if (x!=p[x]) return find_set(p, p[x]); return p[x]; }

void _union(int p[], int x, int y){ int a = find_set(p, x); int b = find_set(p, y); p[a] = b; cout int main(){

}

# Only C++ code is needed. Please, Solve this properly.

Implement the following algorithm for checking whether two vertices are connected or not in an undirected unweighted graph. The disjoint set has been already implemented in the attached file disjoint-set.cpp