Construct a three-tape Turing machine to determine whether a student passes a course. The initial configuration of Tape-1 is BsB, where s is the unary-notation representation of the student's score. The initial configuration of Tape-2 is BmB, where m is the unary-notation representation of the minimum score a student needs to pass the course. Tape-3 is initially blank, but should have a final configuration of either B11B or B1B (1 and 0 respectively in unary notation), depending on whether the student passes or fails the course. In addition to the state diagram, be sure to provide an English-language description of the strategy employed by your Turing machine to perform the computation, and how the states and transitions implement that strategy. Analyze, as accurately as possible the space and time complexities of your machine