WORST_CASE(?,O(n^1))

Solution:
---------

  "++" :: ["A"(0) x "A"(8)] -(8)-> "A"(8)
  "++" :: ["A"(0) x "A"(5)] -(5)-> "A"(5)
  "++" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "++" :: ["A"(0) x "A"(6)] -(6)-> "A"(6)
  "merge" :: ["A"(8) x "A"(5)] -(1)-> "A"(0)
  "nil" :: [] -(0)-> "A"(5)
  "nil" :: [] -(0)-> "A"(8)
  "u" :: [] -(0)-> "A"(0)
  "u" :: [] -(0)-> "A"(8)
  "v" :: [] -(0)-> "A"(5)
  "v" :: [] -(0)-> "A"(12)
  "v" :: [] -(0)-> "A"(11)


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




Base Constructors:
------------------
  "\"++\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "\"nil\"_A" :: [] -(0)-> "A"(1)
  "\"u\"_A" :: [] -(0)-> "A"(1)
  "\"v\"_A" :: [] -(0)-> "A"(1)