Recursive definition

We can define sorted lists of integers as follows:

BASIS - A list consisting of a single integer is sorted.

INDUCTION - If L is a sorted list in which the last element is a and if b >= a, then L followed by b is a sorted list.

Prove that this recursive definition of "sorted list" is equivalent to our original, nonrecursive definition, which is that the list consist of integers

a1 <= a2 <= .... <= an

Remember, you need to prove to parts:

(a) If a list is sorted by the recursive definition, then it is sorted by the nonrecursive definition

(b) if a list is sorted by the nonrecursive definition, then it is sorted by the recursive definition.  

Part(a) can use induction on the number of times the recursive rule is used, and (b) can use induction on the length of the list.