Fuel Tank $($Chocolate Problem!$)$

There are $N_{?}$ cities

and $M_{?}$ bidirectional roads. You can store upto $C_{?}$ liters of fuel and you start with a full tank.

For every road $($i$,$j$),$ we know Wlillil liters of fuel will be burnt.

You can buy refuel at ith city at cost of costlil Rupees $/$ liter.

Find minimum cost path to travel from source$-$city to target$-$city.

draw graph fo r above qustin to align it with dijstra method