Consider the following adjacency matrix of a graph G$.$

a$)$ Apply BFS $($breadth first search$)$ starting at any node from which you can start. Draw the resulting tree or forest.

b$)$ Find a topological ordering of the nodes in G in case there is an order, if not then state clearly why an order does not exist.