Optimal Binary Search Tree Using Dynamic Programming In Daa Example