WORST_CASE(?,O(n^1))

Solution:
---------

  "cons" :: ["b"(0) x "a"(3)] -(3)-> "a"(3)
  "cons" :: ["b"(0) x "a"(4)] -(4)-> "a"(4)
  "cons" :: ["b"(0) x "a"(0)] -(0)-> "a"(0)
  "group3" :: ["a"(3)] -(2)-> "a"(0)
  "group3#1" :: ["a"(3)] -(1)-> "a"(0)
  "group3#2" :: ["a"(3) x "b"(0)] -(3)-> "a"(0)
  "group3#3" :: ["a"(3) x "b"(0) x "b"(0)] -(2)-> "a"(0)
  "nil" :: [] -(0)-> "a"(3)
  "nil" :: [] -(0)-> "a"(4)
  "nil" :: [] -(0)-> "a"(0)
  "tuple#3" :: ["b"(0) x "b"(0) x "b"(0)] -(0)-> "b"(0)
  "zip3" :: ["a"(4) x "a"(0) x "a"(0)] -(2)-> "a"(0)
  "zip3#1" :: ["a"(4) x "a"(0) x "a"(0)] -(1)-> "a"(0)
  "zip3#2" :: ["a"(0) x "a"(0) x "b"(0) x "a"(4)] -(4)-> "a"(0)
  "zip3#3" :: ["a"(0) x "b"(0) x "a"(4) x "b"(0) x "a"(0)] -(3)-> "a"(0)


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