Please help with both problems. I am confused how to construct a linear time algorithm. I understand what it is but not how to achieve it.

Thanks!

(2 points) Weiss 9.12 Suppose that G-(VE) is a tree, s is the root, and we add a vertex t and edges of infinite capacity from all leaves in G to t. Give a linear-time algorithm to find a maximum flow from s to t. 2. 3. (2 points) Weiss 9.39 A graph is k-colorable if each vertex can be given one of k colors, and no edge connects identically colored vertices. Give a linear-time algorithm to test a graph for two-colorability. Assume graphs are stored in adjacency list format; you must specify any additional data structures that are needed