--- a/coursework/cw01.tex	Thu Sep 28 19:07:37 2017 +0100
+++ b/coursework/cw01.tex	Tue Oct 03 23:01:06 2017 +0100
@@ -28,6 +28,9 @@
 exception is the Scala code I showed during the lectures or
 uploaded to KEATS, which you can freely use.\bigskip
 
+\noindent
+If you have any questions, please send me an email in \textbf{good}
+time.\bigskip
 
 \subsection*{Task}
 
@@ -100,7 +103,7 @@
 
 
 
-\subsection*{Question 1}
+\subsection*{Question 1 (Unmarked)}
 
 What is your King's email address (you will need it in
 Question 4)?
@@ -259,8 +262,9 @@
 \item \texttt{"/*test/*test*/"}
 \end{enumerate}
 
-\noindent
-Also let $r_1$ be the regular expression $a\cdot a\cdot a$ and $r_2$ be
+\subsection*{Question 5}
+
+Let $r_1$ be the regular expression $a\cdot a\cdot a$ and $r_2$ be
 $(a^{\{19,19\}}) \cdot (a^?)$.  Decide whether the following three
 strings consisting of $a$s only can be matched by $(r_1^+)^+$.
 Similarly test them with $(r_2^+)^+$. Again answer in all six cases