WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(10, 10)
  "cons" :: ["A"(10, 10) x "A"(2, 10)] -(2)-> "A"(2, 10)
  "cons" :: ["A"(10, 10) x "A"(5, 10)] -(5)-> "A"(5, 10)
  "cons" :: ["A"(10, 10) x "A"(4, 10)] -(4)-> "A"(4, 10)
  "f" :: ["A"(8, 2)] -(10)-> "A"(0, 0)
  "g" :: ["A"(2, 10)] -(0)-> "A"(10, 10)
  "h" :: ["A"(5, 10)] -(0)-> "A"(14, 14)
  "s" :: ["A"(8, 2)] -(8)-> "A"(8, 2)
  "s" :: ["A"(10, 10)] -(10)-> "A"(10, 10)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1, 0)
  "\"0\"_A" :: [] -(0)-> "A"(0, 1)
  "\"cons\"_A" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
  "\"cons\"_A" :: ["A"(1, 1) x "A"(0, 1)] -(0)-> "A"(0, 1)
  "\"s\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "\"s\"_A" :: ["A"(0, 1)] -(0)-> "A"(0, 1)