WORST_CASE(?,O(n^1))

Solution:
---------

  a :: [] -(0)-> A(0)
  activate :: [A(0)] -(2)-> A(0)
  c :: [A(0)] -(0)-> A(0)
  f :: [A(0)] -(1)-> A(0)
  g :: [A(0)] -(0)-> A(0)
  n__f :: [A(0)] -(0)-> A(0)


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