$1.$ Write the order in which the nodes would be visited in when doing a breadth first search $($BFS$)$ traversal starting at node $6.$ Also, write the distances from $6$ to every other node.

$2.$Write the order in which the nodes would be visited in when doing a depth first search $($DFS$)$ traversal starting at node $6.$ Also specify the order in which vertices are removed from the stack.