WORST_CASE(?,O(n^1))

Solution:
---------

  c :: [A(0) x A(7)] -(7)-> A(7)
  c :: [A(0) x A(15)] -(15)-> A(15)
  f :: [A(7)] -(7)-> A(15)
  g :: [A(15)] -(8)-> A(0)
  s :: [A(7)] -(7)-> A(7)
  s :: [A(0)] -(0)-> A(0)


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

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


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