3. Let each function on the left-hand side below represent the exact time (or space) complexity of an algorithm. For each part, answer whether the given expression is true or false.

If you aren't sure, refer the definitions of big-O, big-, and big-8. (a) m² +5m-50= 0(m²) (b) m² +5m-50 = 0(m¹) (c) m² +5m-50 =0(m²) (d) m² +5m-50= (m²) (e) m² +5m-50 = 8(m³) (1) m² +5m-50 = 8(m*) (g) 2(m+3) = (2m) This content is protected and may not be shared, uploaded, or distributed. p. 2003