Prof. Bhide likes to trick Mr$.$ Jethalal. He has a graph of Gokuldham as shown in the following figure. Prof. Bhide asked Mr$.$ Jethalal to visit all $0$ to $8$ houses with minimum energy requirement. Edges on graph are showing energy required to walk from a house to another house. During odd hours, Mr$.$ Jethalal needs to spend energy. Hence, during odd hours, edges are having positive values, $($e$.$g$,$ edge between $0$ and $1$ will have value $4).$ During even hours, Mr$.$ Jethalal gains energy through Fafda$-$Jalebi food on the route. Hence, during even hours, all edges are having same negative values, $($e$.$g$.,$ edge between $0$ and $1$ will have value $-4).$

Use Prim's algorithm to find minimum spanning tree for Mr$.$ Porter to cover all rooms with minimum energy. Assume that you starts with odd hours and require exact $1$ hour to find a minimum edge. Assume that starting vertex for Prim's algorithm is $0.$

As your answer, you need to write the sequence of edges chosen during execution of Prim's algorithm and the total minimum energy requirements to visit all the rooms