2. Use the breadth-first algorithm to find a spanning tree for the graph in Problem 1.

Write a program for depth-first traversal on the following graph using the algo-rithm defined in this week

10 15 13 4 16 12 14 H Consider the graph given above. Use Kruskal's algorithm to find the minimum spanning tree. a. What is the total weight of the spanning tree? b. List the weights of the selected edges separated by commas in the order of selection.

Write a program to convert a U.S. customary system length in miles, yards, feet and inches to metric system length in kilometers, meters and centimeters. The sample run is shown below. After the number of miles, yards, feet and inches are entered in the textboxes, the length should be converted entirely to inches and then divided by 39.37 to obtain the value in meters. The Int function should be used to break the total number of meters into kilometers and meters. The number of centimeters should be displayed to one decimal place. You must use the constants below, (see underlined bold text.) The needed input (see double underlined), output, constant and formulas are as followsConstants: inches in a mile (63360), inches in a yard (36), inches in a foot (12), inches to meters (39.37)Input: The user will enter the miles, yards, feet and inches.