Algorithm Patterns. Give concise and to-the-point answers to the following. i. Is the algorithm design pattern of Greedy Approach always performs worse (in terms of the quality of the solution found) than Dynamic Programming and Divide and Conquer? Explain your answer. Give example and/or justification for your answer. ii. What are the key elements of Dynamic Programming (DP); what properties of a problem would make you think a DP solution is possible? iii. What is the similar and different points of DP and Divide and Conquer methodologies