Assignment:
Q1. Use the breadth-first search algorithm to find a spanning tree for the following connected graph. Start with A and use alphabetical order when there is a choice for a vertex.
Q2. For the following rooted tree, identify the following:
(a) Which node is the root?
(b) Which nodes are the internal vertices?
(c) Is the rooted tree a binary tree?
Q3. Let S = {a, b, c}.
(a) List all the 2-permutations of S.
(b) List all the 2-combinations of S.
Provide complete and step by step solution for the question and show calculations and use formulas.