How can you devise an algorithm to determine the minimum effective bribe, ensuring an optimal strategy with the smallest total amount of cash used in the worst-case scenario?
A) Greedy Algorithm
B) Divide and Conquer Algorithm
C) Dynamic Programming
D) Randomized Algorithm