There are multiple routes to reach from node $1$ to node $2$, as shown in the network.
The cost of travel on an edge between two nodes is given in rupees. Nodes $\text{‘}a\text{’}, \text{‘}b\text{’}, \text{‘}c\text{’}, \text{‘}d\text{’}, \text{‘}e\text{’},$ and $\text{‘}f\text{’}$ are toll booths. The toll price at toll booths marked $\text{‘}a\text{’}$ and $\text{‘}e\text{’}$ is Rs. $200$, and is Rs. $100$ for the other toll booths. Which is the cheapest route from node $1$ to node $2$?
- $1-a-c-2$
- $1-f-b-2$
- $1-b-2$
- $1-f-e-2$