Insufficient Overlapping Subproblems and the Principle of Optimality (Optimal Substructure) are both acceptable queries for dynamic programming. Consider All-Pairs Shortest Paths as an illustration of the difficulty in achieving these two requirements.

I need to construct a optimal binary search tree (OBST).  I am using Python to create this code. I already started creating the binary search tree. I need help trying to implement the optimal binary search tree. I did the class and then I did the insertion next to add the nodes. There needs to be at least 20 nodes. After that, I'm stuck. Not sure what code is needed to add for optimal cost.  Criteria from my assignment: Contains at minimum 20 nodes.  All paths must have a cost between 1-15. You must use each cost at least once with the remaining costs of your choice in the same range. All nodes must be able to communicate with all other nodes (does not have to be a direct path) Each node can only connect to, at maximum, 5 other nodes. The cost of an extra hop is 1 1/2 times the cost of the second path and 2 times the cost of a third path.  Any path greater than 3 is at the same cost as the third. This is what is required for us in the assignment.  My Code in Python: class BST:def…

Develop a model for generating random instances of the parallel job-scheduling-with-deadlines problem. Your goal is to generate nontrivial problems that are likely to be feasible

Marco Dorigo developed Ant Colony Optimization (ACO) algorithm and this algorithm is used to solve many case studies. Let's say, you are using ACO to solve Travelling Repairman Problem (TRP). Describe the process on how ACO implemented in TRP case study. State if there are any improvisation you would like to make in ACO to improve the implementation in TRP case study. Following Figure 2 shows the definition of the case study. Also, include which algorithm, PSO or ACO, is better used for solving TRP case study. You may use any illustration/description to describe your solution. Travelling repairman problem (TRP) is a scheduling problem whereby a repairman must visit the scheduled locations to conduct the job needed. Each location has a period/time in which the repairman is allowed to arrive. This is to allow maximum number of repair jobs are successfully performed.