The topic for the tutorgroup meetings of Monday May 23 and Wednesday
May 25 is the construction of a classical Turing machine. Therefore,
you are supposed to study Section 4.2.

The cTM that will be discussed takes as input strings of the form
w*v1*...*vn, i.e., n+1 strings separated by a marker *. For
simplicity, it is assumed that the strings w, v1, ..., vn are
non-empty strings over the alphabet {a,b} and are all of equal
length. Moreover, n is assumed to be at least 1. 

The function the cTM is to compute will return Y if the string w is
equal to at least one of the strings v1 upto vn, and will return N
otherwise.