Let X, Y, and Z be independent integer-valued random variables. Give an algorithm to determine Pr[X + Y + Z ≥ k].
A. Dynamic programming
B. Monte Carlo simulation
C. Greedy algorithm
D. Breadth-first search