*****************Series Output***********************


Upper Bound of append(A,B) is nat(A)+1.

Upper Bound of split(A,B) is nat(B-1)+1.

Upper Bound of qs(A) is -2*nat(A)+8*pow(2,nat(A))-7.

*****************RAML Output*************************

The number of ticks consumed by split is at most:
          n + 1.0
where
   n is the length of the second component of the input

The number of ticks consumed by append is at most:
          n + 1.0
where
   n is the length of the first component of the input
   m is the length of the second component of the input

The number of ticks consumed by quicksort is at most:
          n^2 + 3.0*n + 1.0
where
   n is the length of the input