Q$3$: Given a string s$,$ write a Python program that counts the number of occurrences of each unique character of s $($a$.$k$.$a$.,$ histogram$)$ and return the result in a dictionary. The order of the unique characters does not matter.

Example $1$: If s $=$ 'abcdefgaaccdef', your returned dictionary should be $\{\text{'}$a$\text{'}$: $3,\text{'}$b$\text{'}$: $1,\text{'}$c$\text{'}$: $3,\text{'}$d$\text{'}$: $2,\text{'}$e$\text{'}$: $2,\text{'}$f$\text{'}$: $2,\text{'}$g$\text{'}$: $1\}.$

Example $2$: If s $=$ 'Abcdefgaaccdef', your returned dictionary should be $\{\text{'}$A$\text{'}$: $1,\text{'}$b$\text{'}$: $1,\text{'}$c$\text{'}$: $3,\text{'}$d$\text{'}$: $2,\text{'}$e$\text{'}$: $2,\text{'}$f$\text{'}$: $2,\text{'}$g$\text{'}$: $1,\text{'}$a$\text{'}$: $2\}.$

return lcm