  Borwein et al. (2000) solved a surprise maximization problem by applying
results from convex analysis and mathematical programming. Although, their
proof is elegant, it requires advanced knowledge from both areas to understand
it. Here, we provide another approach to derive an optimal solution of the
problem by utilizing dynamic programming.
