WORST_CASE(?,O(n^2))

Solution:
---------

  0 :: [] -(0)-> A(8, 6)
  0 :: [] -(0)-> A(6, 14)
  0 :: [] -(0)-> A(4, 12)
  a__tail :: [A(2, 6)] -(3)-> A(2, 6)
  a__zeros :: [] -(3)-> A(2, 9)
  cons :: [A(2, 6) x A(8, 6)] -(2)-> A(2, 6)
  cons :: [A(8, 6) x A(14, 6)] -(8)-> A(8, 6)
  cons :: [A(2, 12) x A(14, 12)] -(2)-> A(2, 12)
  mark :: [A(8, 6)] -(4)-> A(2, 6)
  tail :: [A(8, 6)] -(8)-> A(8, 6)
  tail :: [A(2, 6)] -(2)-> A(2, 6)
  zeros :: [] -(0)-> A(8, 6)
  zeros :: [] -(0)-> A(14, 15)
  zeros :: [] -(0)-> A(4, 15)


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

  0 :: [] -(0)-> A_cf(0, 0)
  a__tail :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  a__zeros :: [] -(0)-> A_cf(0, 0)
  cons :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
  mark :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  tail :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
  zeros :: [] -(0)-> A_cf(0, 0)


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1, 0)
  0_A :: [] -(0)-> A(0, 1)
  cons_A :: [A(1, 0) x A(1, 0)] -(1)-> A(1, 0)
  cons_A :: [A(0, 1) x A(1, 1)] -(0)-> A(0, 1)
  tail_A :: [A(1, 0)] -(1)-> A(1, 0)
  tail_A :: [A(0, 1)] -(0)-> A(0, 1)
  zeros_A :: [] -(0)-> A(1, 0)
  zeros_A :: [] -(0)-> A(0, 1)