Traverse the following graph, starting from root of tree, by using Depth First Search and Breadth First Search algorithms. Make sure that when there are multiple nodes to be considered, the left side one will be selected. Draw, separately, the result of each algorithm. What are the main data structures employed when implementing DFS and BFS on a graph?