1) Give an example of the three variations of Decrease-and-Conquer technique:

a) decrease by a constant (usually one)

b) decrease by a constant factor (e.g., like cutting the input in half)

c) variable size decrease

2) Trace the DFS algorithm on the following graph.

3) What would be the efficiency DFS if an adjacency matrix is used to represent the graph?

4) What would be the efficiency DFS if an adjacency list is used to represent the graph?