fig radix sort step summary this explored the use of linear sequences in computer programming these sequences come in many forms including randomly accessible listsmatriceslinked listsstacksand queues we also saw that two-dimensional matrix is just list of lists the also explored operations as related to these datatypes and the complexity of these operations algorithms were also an important part of four the selection sortmerge sortand quicksort algorithms were studied along with their computational complexities minimax was presented as an interesting case study on using two-dimensional matrices and recursion in program the infix evaluator and radix sort algorithms were also presented as examples of using stacks and queues having read this you should have an understanding of abstract data types like listsstacksand queues you should understand how an abstract data type is implementedhow the implementation can affect the complexity of its operationsand at least few algorithms that use these data types in their implementations review questions answer these short answermultiple choiceand true/false questions to test your mastery of the what is the best caseworst caseand average case complexity of selection sortmerge sortand the quicksort algorithms how can the append operation achieve ( complexity when it sometimes runs out of space to append another item what is the complexity of the concatenation operatorthe operatorfor lists what is the complexity of the deletion operator for liststhis copy belongs to 'acha