WORST_CASE(?,O(n^1))

Solution:
---------

  activate :: [A(15)] -(9)-> A(6)
  c :: [A(15)] -(11)-> A(6)
  d :: [A(0)] -(1)-> A(7)
  f :: [A(6)] -(14)-> A(6)
  g :: [A(0)] -(3)-> A(7)
  h :: [A(14)] -(15)-> A(0)
  n__d :: [A(0)] -(0)-> A(15)
  n__f :: [A(15)] -(15)-> A(15)
  n__f :: [A(0)] -(0)-> A(0)
  n__f :: [A(6)] -(6)-> A(6)
  n__g :: [A(0)] -(0)-> A(15)
  n__g :: [A(0)] -(0)-> A(7)


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

  activate :: [A_cf(0)] -(0)-> A_cf(0)
  c :: [A_cf(0)] -(0)-> A_cf(0)
  d :: [A_cf(0)] -(0)-> A_cf(0)
  f :: [A_cf(0)] -(0)-> A_cf(0)
  g :: [A_cf(0)] -(0)-> A_cf(0)
  n__d :: [A_cf(0)] -(0)-> A_cf(0)
  n__f :: [A_cf(0)] -(0)-> A_cf(0)
  n__g :: [A_cf(0)] -(0)-> A_cf(0)


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