where x is a list of numbers. Function returns true (#t) if numbers are in ascending order, false (#f) if not.

Examples

> (is-sorted (1 2 3 4 5))

#t

> (is-sorted (2 1 2 3 4))

#f

Algorithm

If x is one element return #t

Else

Evaluate 1st element of x < 2nd element of x

Evaluate function recursively with argument (cdr x)

Value is the AND of the two expressions

write a racket functions