Quiz: Dijkstra Modifications

In the Maximum Probability problem, edge weights are probabilities between $0$ and $1$. You want to maximize the product of probabilities along a path. How do you adapt Dijkstra for this?

1. A.Negate all weights and find the shortest path
2. B.Use a max-heap instead of a min-heap and update with multiplication instead of addition
3. C.Convert probabilities to integers by multiplying by $100$
4. D.Run Dijkstra normally. It works with probabilities without changes