operation matrix sparse matrix constructor ( ( numrows( ( ( numcols( ( ( scaleby(xo( (kx [ ,jo( (ks[ ,jx ( (kr ( ( table comparison of the worst case time-complexities for the matrix class implemented using - array and the sparsematrix class using list exercises arrange the following expressions from slowest to fastest growth rate log log log log determine the (*for each of the following functionswhich represent the number of steps required for some algorithm (at (nn (et ( ( (bt ( (ft (nkkn log (ct ( log (gt (nk log (dt (nlog what is the time-complexity of the printcalendar(function implemented in exercise determine the (*for the following set operations implemented in difference()intersect()and remove( what is the time-complexity of the proper subset test operation implemented in exercise prove or show why the worst case time-complexity for the insert(and remove(list operations is (