WORST_CASE(?,O(n^1))

Solution:
---------

  a :: [] -(4)-> A(0)
  activate :: [A(10)] -(5)-> A(0)
  c :: [A(0)] -(0)-> A(14)
  f :: [A(0)] -(2)-> A(0)
  g :: [A(0)] -(1)-> A(0)
  n__a :: [] -(0)-> A(10)
  n__a :: [] -(0)-> A(14)
  n__f :: [A(10)] -(10)-> A(10)
  n__f :: [A(0)] -(0)-> A(0)
  n__g :: [A(10)] -(10)-> A(10)
  n__g :: [A(0)] -(0)-> A(0)


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

  a :: [] -(0)-> A_cf(0)
  activate :: [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)
  n__a :: [] -(0)-> A_cf(0)
  n__f :: [A_cf(0)] -(0)-> A_cf(0)
  n__g :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  c_A :: [A(0)] -(0)-> A(1)
  n__a_A :: [] -(0)-> A(1)
  n__f_A :: [A(0)] -(1)-> A(1)
  n__g_A :: [A(0)] -(1)-> A(1)