WORST_CASE(?,O(n^1))

Solution:
---------

  a__c :: [] -(14)-> A(0)
  a__f :: [A(0)] -(2)-> A(0)
  c :: [] -(0)-> A(0)
  c :: [] -(0)-> A(10)
  c :: [] -(0)-> A(14)
  f :: [A(0)] -(0)-> A(0)
  f :: [A(0)] -(0)-> A(14)
  g :: [A(0)] -(0)-> A(0)
  g :: [A(10)] -(10)-> A(10)
  mark :: [A(0)] -(15)-> A(0)


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




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