Question: Define a set of axioms for the ADT sorted list and use them to prove that the sorted list of characters, which is

defined by the sequence of operations

sList $=$ an empty sorted list

sList.insertSorted$(\text{'}$S$\text{'})$

sList.insertSorted$(\text{'}$T$\text{'})$

sList.insertSorted$(\text{'}$R$\text{'})$

sList.removeSorted$(\text{'}$T$\text{'})$

is exactly the same as the sorted list defined by the sequence

sList $=$ an empty sorted list

sList.insertSorted$(\text{'}$T$\text{'})$

sList.insertSorted$(\text{'}$R$\text{'})$

sList.removeSorted$(\text{'}$T$\text{'})$

sList.insertSorted$(\text{'}$S$\text{'})$