WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "Nat"(6, 0)
  "checkF" :: ["Q"(0, 1)] -(3)-> "Q"(0, 1)
  "cons" :: ["Nat"(0, 0) x "L"(1, 0)] -(1)-> "L"(1, 0)
  "cons" :: ["Nat"(0, 0) x "L"(0, 0)] -(0)-> "L"(0, 0)
  "empty" :: [] -(1)-> "Q"(0, 1)
  "enq" :: ["Nat"(6, 0)] -(2)-> "Q"(0, 1)
  "errorHead" :: [] -(0)-> "Nat"(0, 0)
  "errorTail" :: [] -(0)-> "Q"(0, 0)
  "head" :: ["Q"(0, 0)] -(1)-> "Nat"(0, 0)
  "nil" :: [] -(0)-> "L"(1, 0)
  "nil" :: [] -(0)-> "L"(0, 0)
  "queue" :: ["L"(0, 0) x "L"(1, 0)] -(0)-> "Q"(0, 1)
  "queue" :: ["L"(0, 0) x "L"(0, 0)] -(0)-> "Q"(0, 0)
  "rev" :: ["L"(1, 0)] -(2)-> "L"(0, 0)
  "rev'" :: ["L"(1, 0) x "L"(0, 0)] -(1)-> "L"(0, 0)
  "s" :: ["Nat"(6, 0)] -(6)-> "Nat"(6, 0)
  "snoc" :: ["Q"(0, 1) x "Nat"(0, 0)] -(5)-> "Q"(0, 1)
  "tail" :: ["Q"(0, 1)] -(4)-> "Q"(0, 0)


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