Which of the following is true?

Both Dynamic Programming algorithms and greedy algorithms, are self$-$proving, meaning that the correctness of the algorithm is self$-$evident from the pseudocode itself

Dynamic Programming algorithms combine recursive problem solving with memoization to efficiently solve problems

Huffman Encodings are an example of a dynamic programming algorithm which generates encoded texts with the fewest possible characters

Greedy algorithms and Dynamic programming algorithms are primarily used to solve optimization problems, as demonstrated in the class lecture.