Four machines will constitute a GT cell The from$-$to data for the machines are shown in the table below. $($a$)$ Determine the most logical sequence of machines for this data, and construct the network diagram, showing where and how many parts enter and exit the system. $($b$)$ Compute the percentapes of in$-$sequence moves, bypassing moves, and backtracking moves in the solution. $($c$)$ Develop a feasible layout plan for the cell based on the solution.

$\backslash$table$[[,$To$],[$From$,1,2,3,4],[1,0,5,0,25],[2,30,0,0,15],[3,10,40,0,0],[4,10,0,0,0]]$