WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(9)
  0 :: [] -(0)-> A(12)
  0 :: [] -(0)-> A(14)
  f :: [A(9)] -(15)-> A(8)
  g :: [A(9)] -(7)-> A(8)
  s :: [A(9)] -(9)-> A(9)
  s :: [A(12)] -(12)-> A(12)
  s :: [A(8)] -(8)-> A(8)


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

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


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