WORST_CASE(?,O(n^2))

Solution:
---------

  c :: [A(1, 0) x A(0, 0)] -(0)-> A(1, 0)
  c :: [A(1, 0) x A(2, 0)] -(0)-> A(1, 2)
  f :: [A(1, 0)] -(0)-> A(3, 2)
  g :: [A(1, 2)] -(0)-> A(0, 0)
  s :: [A(1, 0)] -(1)-> A(1, 0)
  s :: [A(2, 0)] -(2)-> A(2, 0)
  s :: [A(3, 2)] -(1)-> A(1, 2)
  s :: [A(0, 0)] -(0)-> A(0, 0)


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

  c :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  f :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  g :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)