WORST_CASE(?,O(n^2))

Solution:
---------

  "f" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "f" :: ["A"(0, 4)] -(4)-> "A"(4, 4)
  "f" :: ["A"(0, 4)] -(4)-> "A"(0, 4)
  "f" :: ["A"(0, 4)] -(4)-> "A"(7, 4)
  "f" :: ["A"(0, 0)] -(0)-> "A"(12, 0)
  "f" :: ["A"(0, 0)] -(0)-> "A"(14, 0)
  "f" :: ["A"(0, 0)] -(0)-> "A"(8, 0)
  "g" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "g" :: ["A"(4, 0)] -(4)-> "A"(4, 4)
  "g" :: ["A"(4, 0)] -(4)-> "A"(4, 0)
  "g" :: ["A"(0, 0)] -(0)-> "A"(0, 8)
  "g" :: ["A"(4, 0)] -(4)-> "A"(4, 14)
  "g" :: ["A"(0, 0)] -(0)-> "A"(0, 4)
  "p" :: ["A"(0, 0)] -(11)-> "A"(14, 14)
  "q" :: ["A"(4, 4)] -(6)-> "A"(14, 14)


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




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