really need help. All information that i have is posted,

In java 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. Solve the following binary search algorithm using dynamic programming (Adapted from Esquivalience, 2018): Graph To solve this problem, complete the following tasks: Create a binary search tree using a data structure. Insert the node values as described in the given image. Use dynamic programming to implement the binary search tree. You must also complete the following activities: Break the tree into a number of subtrees. Provide a dynamic programming function to calculate the minimum cost of a binary tree. this all the information the assignment gives below.

Im not for sure what would be missing To solve this problem, complete the following tasks:

Create a binary search tree using a data structure.

Insert the node values as described in the given image.

Use dynamic programming to implement the binary search tree.

You must also complete the following activities:

Break the tree into a number of subtrees.

Provide a dynamic programming function to calculate the minimum cost of a binary tree.

Best case (1 comparison) 8 n= 15