WORST_CASE(?,O(n^1))

Solution:
---------

  "a" :: [] -(0)-> "A"(9)
  "a" :: [] -(0)-> "A"(14)
  "a" :: [] -(0)-> "A"(13)
  "a__f" :: ["A"(9)] -(10)-> "A"(9)
  "f" :: ["A"(9)] -(9)-> "A"(9)
  "f" :: ["A"(14)] -(14)-> "A"(14)
  "f" :: ["A"(0)] -(0)-> "A"(0)
  "g" :: ["A"(0)] -(0)-> "A"(14)
  "g" :: ["A"(0)] -(0)-> "A"(9)
  "g" :: ["A"(0)] -(0)-> "A"(15)
  "mark" :: ["A"(14)] -(8)-> "A"(9)


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




Base Constructors:
------------------
  "\"a\"_A" :: [] -(0)-> "A"(1)
  "\"f\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"g\"_A" :: ["A"(0)] -(0)-> "A"(1)