(1) Write a C++ code to find the Breadth First Traversal and Depth First Traversal on a given graph from a input file. The output in the sequence of nodes traverse is to be written back in an output file

(2) Write a C/C++ code to find out the best three minimum spanning trees (1st best < 2 nd best < 3 rd best) of a given graph carefully using the Kruskals and Prims algorithm. Assume that the graph is given in a input file. The minimum spanning trees are to be written back in an output file.