In the following digraph, find a shortest path from s to t by formulating an appropriate linear program and then solving (you may use a computer program to solve the linear program). Formulate the dual linear program, and use the dual to prove that your solution is optimal. In the following digraph, find a shortest path from s to t by formulating an appropriate linear program and then solving (you may use a computer program to solve the linear program). Formulate the dual linear program, and use the dual to prove that your solution is optimal