Given the posted DIREC$(2$D$)$ CIBAPI:

a$)$ Ereeute a Depth$-$Fitst Search on the graph, with the following condlitions:

Start from vertex $B.$

Follow the "hormal DFS$"$ algorithm using DIBECTIED edgest NOIE:

There are thrse types of edges on a DFS dignaph:

Forward edges are edges $uv$ with $v$ not previously visited. Use a solld line

Back edges are ediges $mv$ with $v$ already visited. Use a dotted tine.

Cross edges are edges where there is no edgeu$v.$ Use a dotted tine.

b$)$ Are there any diseated egreles in the given graphp Ideatify them by the vertices in ordes.

Is this graph atrongly connected? $(13$ there a dirseted parth betwem every pair of verices?$)$