I would be really grateful if you could help me out with the details. I am really confused about this assignment. And please don't copy other answers to here.

This assignment is the construction of a Universal Turing Machine simulator. The UTM simulator will accept as input the description of a Turing Machine along with the initial configuration of the tape, the machine input. The simulator will process the input on the tape, and the output, if any, will be on the tape at the end of the computation. The initial tape input will be enclosed in the characters ' '. The machine should halt if it attempts to move beyond either end of the input string. The machine will accept if it is in the accept state when it halts; otherwise if will fail. The input has the following format nraw//Numberofstates//Numberofrules//TMtransitionrules//Acceptstate//Initialconfigurationofthetape The format of the TM transition rules is currentState moveDirection (R/L/S) The sample input and output are for a TM accepting the language L={anbn:n>0} The UTM should halt on all undefined states, when there is no transition defined for the current input and state. Be sure to report a FAIL if the simulator halts and does not accept