Graph Algorithms

: BFS and DFS Problem:

Given the following graph:

$($a$)$ Perform a Breadth$-$First Search $($BFS$)$ starting from vertex A$.$

$($b$)$ Perform a Depth$-$First Search $($DFS$)$ starting from vertex A$.$