CAN YOU PLEASE SOLVE THIS OPERATION RESEARCH PROJECT ABOUT NETWORK MODELS, We have a network that comprises a total of $47$ nodes $,$ theres four problems to solve : $-$first with Shortest Route: Imagine that you are at node $1$ and your ultimate goal is to reach node $47.$ Your task is to determine the shortest route that will lead you to your destination efficiently and effectively. Consider factors such as distance, time, and resource constraints to optimize your solution. $-$second with Computer Network: Picture these nodes as a complex computer network, where each node represents a computer and the links between them denote the cost of building connections. Your objective is to connect all the nodes together while minimizing the overall cost of establishing these connections. Take into account factors such as bandwidth, latency, and capacity to design an efficient and cost$-$effective network. $-$third with Water Network System: In this scenario, you are tasked with designing a water network system. Nodes $1$ and $2$ serve as the input points, while nodes $23,35,$ and $47$ represent different areas of a city where water needs to be supplied. Your challenge is to calculate the maximum flow that this network can handle, ensuring efficient water distribution throughout the city. Consider factors such as water pressure, pipe diameter, and demand to optimize the flow and minimize losses. $-$forth with Travelling Salesman Problem: Building upon the second problem, you need to add one more condition to the network. Each node should have one input and one output only, creating a circular network. Your objective is to solve this transformed problem, known as the Travelling Salesman Problem $($TSP$),$ and find the optimal route that connects all the nodes in the most efficient way. Take into account factors such as distance, time, and resource constraints to optimize your solution.