Do all of the following.

1. The alphabet for all these examples is {z,n,b}
   1. 2 or more z followed by one or more of ( either ( n followed by zero or one of n ) or ( b followed by z followed by n ) ) followed by exactly 4 b's followed by exactly 2 n's
   2. all strings that do not contain the substring bnbz
   3. starts with 5 or more nzn's, ends with 1 or more bb's, and does not contain the substring nb.

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)