Do all of the following.

1. The alphabet for all these examples is {f,t,h}
   1. 5 or more f followed by one or more of ( either ( t followed by zero or one of t ) or ( h followed by f followed by t ) ) followed by exactly 6 h's followed by exactly 2 t's
   2. all strings that do not contain the substring hthf
   3. starts with 6 or more tft's, ends with 4 or more hh's, and does not contain the substring th.

2. For the next questions, use the following signature

   signature lab02 = sig
    type `a seq
    make `a seq
    get `a seq -> `a
    put `a * `a seq -> `a seq
    warp `a seq -> `a seq
    nada `a seq -> bool
end
   1. What is the type of
      1. warp
      2. nada(make)
      3. get (make)
      4. get (warp)
      5. get (put )
      6. put (warp(put (1, lab02.make)),lab02.make)
      7. put (nada(make)), make)

      where the lab02.xxx notation means that a new instance of the module is used every time -- in other words, the `a are independent

   2. What is the value (if any) of
      1. put (2, put (3, make))
      2. nada(make)