Data structures

problem. Show your steps on the heap. 6. Fill the following table, show your work. Dominant Term 0(?) Expression 3 +0.01n+0.04n 400n +50n1.5+30nlogn nlogn+n(logn)2 100n 0.02m2 250nlogn + 1000log (logn)