Question 6 Figure 1 shows a computer network that represented in graph design. B A F D G a) Figure 1 Suppose that a message is to be sent through the computer network of the graph in Figure 1, from A to G. It is possible that some computers are down at the time. The message must be sent through as few computers as possible but must not be sent through a computer that is down. What is the shortest route for the message? i. When no computers are down; ii. When computers B and D are down; iii. When computers B, D, and F are down. (3 marks) Develop a pseudocode that adapted breadth-first search algorithm. Assume that any computer can be asked whether it is up or down. Also assume that both A and G are up. b)