The client requests code written for a Smalltalk project with access to Monticello repository (Pharo environment is used). An example class is provided in the package from the repository. Must implement the Edit-distance, Knapsack-with-repetition, and Chain-matrix-multiplication algorithms using some of the methods provided using the Smalltalk programming language, as well as unit tests for them. In addition to implementing and providing a "proof" for the 3 algorithms, the Huffman coding algorithm provided must also have a "proof" done that for each method, add self assert: [ code_block ] statements to "prove" the method correct. A deliverable in the form of .st files (file out) or a .mcv file is accepted.