Using C++ programming language solve the following problem: You are given NN points in DD-dimensional space. The ih point has D coordinates - X, 1,x,2..Xı,D. Consider a weighted undirected complete...

Extracted text: Using C++ programming language solve the following problem: You are given NN points in DD-dimensional space. The ih point has D coordinates - X, 1,x,2..Xı,D. Consider a weighted undirected complete graph with these NN points as its vertices. Weight of the edge between points ii and j is |xi, 1–xj, 1|+|xi,2–xj,2|+...+|xi,D-xj,D||xi, 1-xj,1|+|xi,2-xj,2|+ ..+|xi,D-xj,DJ. Find the weight of the maximum spanning tree of this graph. Input: 22 11 22 Output: 2