Huffman compression reduces the average code length used to represent the symbols of an alphabet. Symbols of the source alphabet which occur frequently are assigned with short length codes. The general strategy is to allow the code length to vary from character to character and to ensure that the frequently occurring character have shorter codes. Given is a set of symbols with a list of relative probabilities of occurrence within a message. 

I	T	c	e	g	h	l	n	o	r	t	y
1	1	1	3	1	1	1	3	2	1	2	1

Do a step by step work in constructing a Huffman binary tree and get the resultant codewords.