WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(2)
  0 :: [] -(0)-> A(0)
  S :: [A(2)] -(2)-> A(2)
  S :: [A(0)] -(0)-> A(0)
  compS_f :: [A(1)] -(1)-> A(1)
  compS_f#1 :: [A(1) x A(0)] -(1)-> A(0)
  id :: [] -(0)-> A(1)
  iter#3 :: [A(2)] -(1)-> A(1)
  main :: [A(2)] -(1)-> A(0)


Cost Free Signatures:
---------------------

  0 :: [] -(0)-> A_cf(0)
  S :: [A_cf(0)] -(0)-> A_cf(0)
  compS_f :: [A_cf(0)] -(0)-> A_cf(0)
  compS_f#1 :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  id :: [] -(0)-> A_cf(0)
  iter#3 :: [A_cf(0)] -(0)-> A_cf(0)