WORST_CASE(?,O(n^1))

Solution:
---------

  f :: [A(15)] -(0)-> A(0)
  g :: [A(15)] -(15)-> A(15)


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

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


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