Please help.

1.

2.

For each function below, give the time cost of each individual line of code in big-Oh notation. This time, though, give the total cost for that ilne, across all iterations. (That is, an O(1) line, which runs O(n) times, should be listed as O(n).) Make sure to account for the cost of other functions that these functions call! def max min(vals) : assert len(vals) 0 max = vals[0] min = vals[0] other vals - vals [1:] for v in other vals: if v min: if v max: max = v return (min,max) def wrapper (vals): bigOh 1 func (vals) for in vals: bigoh n func (vals) def list to str (vals): retval = "', for v in vals: new retval = retval + str (vals) retval - new retval return retval