Dynamic programming allows you to break a large problem into multiple subproblems. Each of these subproblems must be solved, and the solution must be stored as a memory-based solution.

Using Java solve the following binary search algorithm using dynamic programming (Adapted from Esquivalience, 2018):

To solve this problem, complete the following tasks:

1. Create a binary search tree using a data structure.
2. Insert the node values as described in the given image.
3. Use dynamic programming to implement the binary search tree.

You must also complete the following activities:

1. Break the tree into a number of subtrees.
2. Provide a dynamic programming function to calculate the minimum cost of a binary tree.

14 www | twitll|s lwis , | = 15 | . | 14 www | twitll|s lwis , | = 15 | . |