WORST_CASE(?,O(n^1))

Solution:
---------

  f :: [A(11)] -(11)-> A(11)
  f :: [A(0)] -(0)-> A(0)
  g :: [A(11) x A(4)] -(8)-> A(0)
  h :: [A(11) x A(4)] -(7)-> A(0)


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

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


Base Constructors:
------------------
  f_A :: [A(1)] -(1)-> A(1)