WORST_CASE(?,O(n^2))

Solution:
---------

  "+" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(0, 0)
  "0" :: [] -(0)-> "A"(3, 3)
  "0" :: [] -(0)-> "A"(1, 0)
  "0" :: [] -(0)-> "A"(0, 0)
  "s" :: ["A"(6, 3)] -(3)-> "A"(3, 3)
  "s" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "sum" :: ["A"(3, 3)] -(1)-> "A"(0, 0)


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




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