WORST_CASE(?,O(n^1))

Solution:
---------

  a :: [] -(0)-> A(7)
  a :: [] -(0)-> A(13)
  a :: [] -(0)-> A(15)
  a :: [] -(0)-> A(8)
  a__f :: [A(7)] -(8)-> A(7)
  c :: [A(0)] -(0)-> A(13)
  c :: [A(0)] -(0)-> A(10)
  f :: [A(7)] -(7)-> A(7)
  f :: [A(13)] -(13)-> A(13)
  f :: [A(0)] -(0)-> A(0)
  f :: [A(5)] -(5)-> A(5)
  g :: [A(13)] -(13)-> A(13)
  g :: [A(0)] -(0)-> A(0)
  g :: [A(7)] -(7)-> A(7)
  mark :: [A(13)] -(2)-> A(7)


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

  a :: [] -(0)-> A_cf(0)
  a__f :: [A_cf(0)] -(0)-> A_cf(0)
  c :: [A_cf(0)] -(0)-> A_cf(0)
  f :: [A_cf(0)] -(0)-> A_cf(0)
  g :: [A_cf(0)] -(0)-> A_cf(0)
  mark :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  a_A :: [] -(0)-> A(1)
  c_A :: [A(0)] -(0)-> A(1)
  f_A :: [A(1)] -(1)-> A(1)
  g_A :: [A(1)] -(1)-> A(1)