WORST_CASE(?,O(n^2)) Solution: --------- 0 :: [] -(0)-> A(9, 5) 0 :: [] -(0)-> A(14, 5) 0 :: [] -(0)-> A(11, 15) 0 :: [] -(0)-> A(15, 15) cons :: [A(4, 0)] -(0)-> A(3, 1) f :: [A(9, 5)] -(8)-> A(0, 0) p :: [A(0, 15)] -(1)-> A(15, 15) s :: [A(14, 5)] -(9)-> A(9, 5) s :: [A(15, 15)] -(0)-> A(0, 15) Cost Free Signatures: --------------------- 0 :: [] -(0)-> A_cf(5, 1) 0 :: [] -(0)-> A_cf(6, 1) 0 :: [] -(0)-> A_cf(15, 11) 0 :: [] -(0)-> A_cf(11, 11) cons :: [A_cf(14, 0)] -(0)-> A_cf(1, 13) f :: [A_cf(5, 1)] -(3)-> A_cf(0, 0) p :: [A_cf(0, 6)] -(0)-> A_cf(6, 3) s :: [A_cf(6, 1)] -(5)-> A_cf(5, 1) s :: [A_cf(6, 6)] -(0)-> A_cf(0, 6) s :: [A_cf(8, 8)] -(0)-> A_cf(0, 8) Base Constructors: ------------------ 0_A :: [] -(0)-> A(1, 0) 0_A :: [] -(0)-> A(0, 1) cons_A :: [A(1, 0)] -(0)-> A(1, 0) cons_A :: [A(1, 0)] -(0)-> A(0, 1) s_A :: [A(1, 0)] -(1)-> A(1, 0) s_A :: [A(1, 1)] -(0)-> A(0, 1)