1. Consider the following maze made up of one-way-streets: 3 The arrows indicate the direction in which movement is possible. A movement from one box into another is indicated with one of the following letters: E (East), W (West), N (North) or S (South) A path through the maze can hence be described as a word over the alphabet E, W,N, S). Let be L C 5 the set of all possible paths from box Al to box C3 Give a regular expression describing L Give a deterministic finite automaton recognizing L