Algorithm Engineering

1x5 3. a) (Write answers with single sentence only) i. Can dynamic programming solve some of the mult-objective problems? ii. What is the use of B-Tree? iii. What is the maximum height of a B-Tree with n number of keys and t branching factor iv. How does B-Tree balance it's tree. v. If an optimization problem has the equation argmax( weight, x value ) is there any greedy heuristic possible to apply on the value/weight to find the optimal? b) Maximum prefix that is also a suffix- what is the relationship of the clause with KMP string matching algorithm? c) Assume the following B-Tree with t=3. 3 5.66 GM, P T X A B C D E J N o QRS UV Y Z Insert L and F in the tree. Show your steps. 3 d) Suppose you are given three techniques: dynamic, greedy and approximation algorithms, how will you try to apply them on a particular problem instance