Consider the following $8$ different commands, steps and$/$or algorithms. Sort them based on their order of time complexity, from lowest order to highest order. Each of the eight items are preceded by a single letter in parentheses. Choose the correct sequence of these letters representing these eight items, again from lowest order to highest order. $($a$)$ a five deep nest of for$-$loops; $($b$)$ exponential base $3$; $($c$)$ classic matrix multiplication; $($d$)$ classic sorting algorithms; $($e$)$ reading in the data for the cells of a one$-$dimensional array; $($f$)$ permutation; $($g$)$ basic built$-$in programming commands; $($h$)$ exponential base $2.$