Turing Machine Design problem

Graph Encodings: Let w E 1,2,3, 4, S, &,:. Design a multi-tape Turing Machine that takes as input it, and accepts iff there is a graph G such that w = G for some G (14). Please see Problem 2 in section written problems for more details of encoding graphs. For example, the correct encoding of a graph could be, $1&2: 1&3 : 1&4 : 2&4: 3&4 The following is not valid encodings of anly graph: $1&3 1&2: 1&4: 2&4: 3&4 $2&4 1&2 : 1&3 : 1&4: 3&4