WORST_CASE(?,O(n^1)) Solution: --------- "cons" :: ["A"(11) x "A"(11)] -(11)-> "A"(11) "cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0) "empty" :: [] -(0)-> "A"(11) "f" :: ["A"(11) x "A"(0)] -(1)-> "A"(0) "g" :: ["A"(11) x "A"(0) x "A"(0)] -(8)-> "A"(0) Cost Free Signatures: --------------------- Base Constructors: ------------------ "\"cons\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1) "\"empty\"_A" :: [] -(0)-> "A"(1)