B$-$Tree of order $4$

Each node has at most $4$ pointers and $3$ keys, and at least $2$ pointers and $1$ key.

$$ Insert: $5,3,21,9,1,13,2,7,10,12,4,8$

Granhc

Construct the following Graph Representation from given Directed Graph above.

Adjacency Matrix

Adjacency List

Show the Depth$-$first and Breadth$-$first traversal

Identify all valid path sequence. Find the shortest path sequence through sum of the weights $($costs$)$ of the edges involved in the path.