Question 4 (30 points): Consider the same graph mentioned in Question 1. Now, I. Apply DFS...

Transcribed Image Text:

Question 4 (30 points): Consider the same graph mentioned in Question 1. Now, I. Apply DFS considering 1 as the source node. If there are multiple options at any step, pick the node with smaller index. Draw the DFS tree. Also, mention all the back-edges. Repeat part II considering 6 as the source node. II. Question 1 (30 Points): Consider the above mentioned graph. Now, I. Apply BFS considering 1 as the source node (level-0 node). Draw the BFS tree and mark each level. If there are multiple options at any step, pick the node with smaller index. Repeat part II considering 6 as the source node (level-0 node). II. 11 10 Question 4 (30 points): Consider the same graph mentioned in Question 1. Now, I. Apply DFS considering 1 as the source node. If there are multiple options at any step, pick the node with smaller index. Draw the DFS tree. Also, mention all the back-edges. Repeat part II considering 6 as the source node. II. Question 1 (30 Points): Consider the above mentioned graph. Now, I. Apply BFS considering 1 as the source node (level-0 node). Draw the BFS tree and mark each level. If there are multiple options at any step, pick the node with smaller index. Repeat part II considering 6 as the source node (level-0 node). II. 11 10