Please answer ASAP. Bonus Part D Write an algorithm to find the diameter of a graph based on either BFS $($Breadth First Search$)$ or DFS $($Depth First Search$).[$Bonus $10$ pts$]$

Hint: Select a node and starting from this node, running BFS$,$ then count the number of nodes it confronts along the path from this selected node to each of the rest nodes, correspondingly. Keep a record of the maximum count for this node. By running over all different starting nodes in the graph, the maximum of maximum count is the diameter of this graph $.$

For example, in the group below, starting from node D$,$ the shortest path to E it can reach: D$->$A$->$B$->$E$.$ Then, by counting the node along this path from D$,$ is $3,$ which is also the LONGEST shortest path of the graph, i$.$e$.,$ the diameter of the graph below.

Tips: Try to make modifications based on BFS or DFS algorithms.