4. Assume that: • Problem Q₁ reduces to problem Q2 in polynomial time, and ● problem Q2 reduces to problem Q3 in polynomial time, and problems Q₁, Q2 and Q3 are all in NP. (a) If Q2 can be solved in polynomial time, what can be concluded about Q₁? (The answer may be nothing.) (b) If Q2 can be solved in polynomial time, what can be concluded about Q3? (The answer may be nothing.) (c) If Q2 is NP-complete, what can be concluded about Q₁? (The answer may be nothing.) (d) If Q2 is NP-complete, what can be concluded about Q3? (The answer may be nothing.)

Urgent

### Problem 4 Let `G` be a graph with `n vertices and `m` edges. True or false: All its DFS forests (for traversals starting at different vertices) will have the same number of trees? True or false: All its DFS forests will have the same number of tree edges and the same number of back edges? Explain your answer

Floor division is shown by which character? A) I/ B) 1 c) (D