WORST_CASE(?,O(n^1))

Solution:
---------

  "a" :: [] -(8)-> "A"(0)
  "activate" :: ["A"(3)] -(12)-> "A"(0)
  "f" :: ["A"(2)] -(1)-> "A"(0)
  "g" :: ["A"(0)] -(8)-> "A"(1)
  "n__a" :: [] -(0)-> "A"(2)
  "n__a" :: [] -(0)-> "A"(3)
  "n__a" :: [] -(0)-> "A"(10)
  "n__a" :: [] -(0)-> "A"(14)
  "n__f" :: ["A"(2)] -(2)-> "A"(2)
  "n__f" :: ["A"(3)] -(3)-> "A"(3)
  "n__f" :: ["A"(0)] -(0)-> "A"(0)
  "n__g" :: ["A"(0)] -(0)-> "A"(3)
  "n__g" :: ["A"(0)] -(0)-> "A"(14)
  "n__g" :: ["A"(0)] -(0)-> "A"(6)


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




Base Constructors:
------------------
  "\"n__a\"_A" :: [] -(0)-> "A"(1)
  "\"n__f\"_A" :: ["A"(0)] -(1)-> "A"(1)
  "\"n__g\"_A" :: ["A"(0)] -(0)-> "A"(1)