WORST_CASE(?,O(n^2))

Solution:
---------

  a :: [] -(5)-> A(0, 0)
  activate :: [A(0, 9)] -(7)-> A(0, 0)
  f :: [A(9, 0)] -(8)-> A(0, 0)
  g :: [A(0, 0)] -(3)-> A(8, 0)
  n__a :: [] -(0)-> A(0, 0)
  n__a :: [] -(0)-> A(0, 9)
  n__a :: [] -(0)-> A(6, 13)
  n__a :: [] -(0)-> A(6, 7)
  n__f :: [A(0, 0)] -(9)-> A(9, 0)
  n__f :: [A(9, 9)] -(9)-> A(0, 9)
  n__f :: [A(0, 0)] -(4)-> A(4, 0)
  n__f :: [A(0, 0)] -(0)-> A(0, 0)
  n__g :: [A(0, 9)] -(9)-> A(0, 9)
  n__g :: [A(0, 0)] -(0)-> A(12, 0)


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

  a :: [] -(0)-> A_cf(0, 0)
  activate :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  f :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  g :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  n__a :: [] -(0)-> A_cf(0, 0)
  n__f :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  n__g :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)


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