WORST_CASE(?,O(n^1))

Solution:
---------

  "activate" :: ["A"(11)] -(3)-> "A"(2)
  "c" :: ["A"(13)] -(6)-> "A"(6)
  "d" :: ["A"(0)] -(1)-> "A"(6)
  "f" :: ["A"(2)] -(10)-> "A"(2)
  "g" :: ["A"(0)] -(2)-> "A"(2)
  "h" :: ["A"(14)] -(14)-> "A"(3)
  "n__d" :: ["A"(0)] -(0)-> "A"(11)
  "n__d" :: ["A"(0)] -(0)-> "A"(13)
  "n__d" :: ["A"(0)] -(0)-> "A"(6)
  "n__f" :: ["A"(11)] -(11)-> "A"(11)
  "n__f" :: ["A"(13)] -(13)-> "A"(13)
  "n__f" :: ["A"(0)] -(0)-> "A"(0)
  "n__f" :: ["A"(2)] -(2)-> "A"(2)
  "n__g" :: ["A"(0)] -(0)-> "A"(11)
  "n__g" :: ["A"(0)] -(0)-> "A"(14)
  "n__g" :: ["A"(0)] -(0)-> "A"(2)


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




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)