In Problem 13.16, coordinates of each node are represented by (x,y) digits, with one corner being (0,0) and other three corners being (0,7), (7,0) and (7,7). Assuming that two messages are to be sent at the same time, one from node (0,0) to (7,7) and the second from node (0,7) to (7,0). Identify the transmission sequence of these two messages so that they do not interfere with each other and follow the shortest path.