Question $3$ Graph search

Implement DFS and BFS$,$ test it for both directed and undirected $8$ vertices $(15$ edges or more$).$ NOTE: construct the graph in any way as far as it satisfies the condition given. Provide the hand drawn implementation of the graph.$]$

$\backslash$table$[[$Graph$,\backslash$table$[[$DFS: Path $($by$],[$hand$)]],\backslash$table$[[$DFS:Path $($by$],[$code$]],\backslash$table$[[$BFS: Path $($by$],[$hand$)]],\backslash$table$[[$BFS$9$ath $($by$],[$code$]]],[\backslash$table$[[$I$($member $1)$:$],[$Directed$],[$Name of the$],[$students$],[$graph$=\{\}]],,,,],[\backslash$table$[[$I$($member $2)$:$],[$Directed$],[$Name of the$],[$student$],[$graph$=]],,,,],[\backslash$table$[[$I$($member $3)$:$],[$Directed$],[$Name of the$],[$student$]],,,,],[\backslash$table$[[$I$($member $4)$:$],[$Directed$],[$Name of the$],[$stndents$]],,,,],[,,,,]]$

submit the aketch of graphs and their python code graph $=\{\}$

b$)($Unitedsies$)$