$($h$)(10$ Pts$)[$Task$-8]$ Define a function called hist$\_$B which takes the Output dictionary $($given by hist$\_$A $[$Task$-7])$ as an input. And create a new dictionary which maps from frequencies to letters.

Sample input$/$Output:

res $=$ hist$\_$A$("$kara murat kim"$))-$ print$($hist$\_$B$($res$))[\text{'}$u$\text{'},\text{'}$t$\text{'},\text{'}$i$\text{'}],2$: $[\text{'},\text{'}$r$\text{'},\text{'}$k$\text{'},\text{'}$m$\text{'}],3$: $[\text{'}$a$\text{'}]\}$

$($i$)(10$ Pts$)[$Task$-9]$ Define a function called getTopelements that takes a string as an input and returns the most common $3$ letters in that string. If the characters have same frequency, it should return in alfabetical order.

Sample input$/$Output:

print$($getTopelements$("$programming$"))$

Most common three letters are: $m,a,g$

$($j$)(10$ Pts$)[$Task$-10]$ Define a function called compress$\_$dict, it compresses the strings that have long sequences of equal characters. The program will accept one string as an argument, and return compressed form of the string.

Sample input$/$Output:

print$($compress$\_$dict$("$aaaabbaaabbbbbbcccd$"))$

$4a2b3a5b3c1d$