Given the following graph: A B 1 2 1 E 1 2 F 1 2 H G 3 d. Fill the following table: [4.5 Point] Number of nodes in the final path (include source and destination) Algo. BFS DFS UCS e. Sketch the paths suggested by the DFS, BFS and UCS algorithm using in its respective figure below. [1.5 Points] D A B A B C E C Path suggested by BFS D F E F Path suggested by UCS H H G Number of Enqueued Weight of the path nodes G A B C E D F Path suggested by DFS H G