Optimal Binary Search Tree Using Dynamic Programming Example