7.4 for searching a graph is inefficient in that processes are only active after their vertex is placed on the queue. Develop a more efficient work-pool approach that keeps processes more active. 7-6....

7.4 for searching a graph is inefficient in that processes are only active after their vertex is placed on the queue. Develop a more efficient work-pool approach that keeps processes more active. 7-6. Write a load-balancing program using Moore’s algorithm and a load-balancing program using Dijkstra’s algorithm for searching a graph. Compare the performance of each algorithm and make conclusions.