$($a$)$ pts$)$ Consider the digraph in Figure $1.$ Starting from $H,$ traverse the graph using BFS and then DFS$,$ while maintaining the priority, i$.$e$.,$ if the algorithm is to decide between which vertices two visit next, it chooses the vertex that has higher priority. The priorities of vertices are according to their alphabetical ordering, i$.$e$.A.$ Print the queue and stack, respectively, $at$ each stage

$(b)(3+3pts)$ Explain Prim's algorithm and Dijkstra's algorithm asing pseudocode

$1$

Figure $1$: