WORST_CASE(?,O(n^1))

Solution:
---------

  f :: [A(9) x A(0)] -(13)-> A(4)
  h :: [A(0)] -(0)-> A(10)
  h :: [A(0)] -(0)-> A(11)
  s :: [A(0)] -(9)-> A(9)
  s :: [A(0)] -(0)-> A(0)


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

  f :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  h :: [A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  h_A :: [A(0)] -(0)-> A(1)
  s_A :: [A(0)] -(1)-> A(1)