WORST_CASE(?,O(n^1))

Solution:
---------

  "a__c" :: ["A"(0)] -(1)-> "A"(0)
  "a__f" :: ["A"(0)] -(2)-> "A"(0)
  "a__h" :: ["A"(0)] -(2)-> "A"(0)
  "c" :: ["A"(3)] -(3)-> "A"(3)
  "c" :: ["A"(0)] -(0)-> "A"(0)
  "d" :: ["A"(3)] -(3)-> "A"(3)
  "d" :: ["A"(0)] -(0)-> "A"(0)
  "f" :: ["A"(0)] -(0)-> "A"(0)
  "f" :: ["A"(3)] -(3)-> "A"(3)
  "g" :: ["A"(3)] -(3)-> "A"(3)
  "g" :: ["A"(0)] -(0)-> "A"(0)
  "h" :: ["A"(3)] -(3)-> "A"(3)
  "h" :: ["A"(0)] -(0)-> "A"(0)
  "mark" :: ["A"(3)] -(0)-> "A"(0)


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




Base Constructors:
------------------