4. For each of the parts below, list the functions in increasing asymptotic order. In some cases functions may be asymptotically equivalent (that is f(n) is (g(n)) ). In such cases ndicate this by writing f(n)=g(n). When one is asymptotically strictly less than the ther (that is, f(n) is O(g(n)) but f(n) is not (g(n)) ), express this as f(n)g(n). For xample, given the set: n2nlogn3n+nlogn, 5 Homework Assignment 1 January 23, 2023 the first function is (n2) and the other two are (nlogn), and therefore the answer would be nlogn=3n+nlognn2. You are not required to show your work; just writing your answer suffices. (a) (3/2)n3(n/2)2(n/3) (d) max(50n2,n3)50n2+n3min(50n2,n3) (e) n2/20n2/20n2/20