Need this in C++

11. Spanning tree 1. A data structure has to be accepted by a laboratory instructor before implementation. 2. The source code has to be split into header (,h) and source (,cpp) files. 3. All functions have to be commented in the doxygen style. 4. Any permutation of command line switches has to be handled. 5. The program executed without parameters prints a short user's manual. 6. The program has to accept slightly imperfect input data. Implement a program that finds a maximum spanning tree in a weighted graph. A graph is stored ir a text file as a sequence of comma-separated triples. Each triple is parenthesized and holds three comma separated values that represent two nodes that define an edge and a weight of an edge. The program elaborates a maximum spanning tree and stores it in a text file in the same format as the input file. Example of an input file: (1,2,4.5),(4,3,4.5),(4,2,0,4)