The Huffiman Encoding

In $1951,$ while taking an Information Theory class as a strudent at MI$,$ David A$.$ Huffman and his classmates were given a chaice by the professor Robert M$.$ Fano: they can either toke the finol exom, or if they want to opt out of it they need to find the most efficient binary code. Hufiman took the road less traveled and the rest they say is history.

Put simply, Hufiman encoding tokes in a text input and generates a binary code $($a string of O$\text{'}$s and $1(9)$ thet represents thet text.

Detrimte the thifumen cots for the string:

blablamante correponethe Hutimen code ond $3$ h hesthes.

Please answer this practice question exactly how it asks as im struggling.