1. Write pseudocode that merges two sorted lists into a new third sorted list by using only ADT sorted list operations. 2. Defi ne a set of axioms for the ADT sorted list and use them to prove that...

1. Write pseudocode that merges two sorted lists into a new third sorted list by using only ADT sorted list operations.

2. Defi ne a set of axioms for the ADT sorted list and use them to prove that the sorted list of characters, which is defi ned by the sequence of operations

sList = an empty sorted list

sList.insertSorted('S')

sList.insertSorted('T')

sList.insertSorted('R')

sList.removeSorted('T')

is exactly the same as the sorted list defi ned by the sequence

sList = an empty sorted list

sList.insertSorted(‘T’)

sList.insertSorted(‘R’)

sList.removeSorted(‘T’)

sList.insertSorted(‘S’)