By producing the Total language tree according to the given CFG; Write a program that lists all the words that make up the language $($repeated words will be written once$).(|$ character will be used as a separator. $-->$ character will be used as a right arrow sign. $,$ character will be used as a line separator$)$

For example $\backslash$Sigma $=\{$a$,$ b$\}$

CFG; S$->$aa$|$bX$|$aXX$,$ X$->$ab$|$b

Words Generated for are:

aa$,$ bab, bb$,$ aabab, aabb, abab, abb

The repeated words are:

aabab, abab, aabb, abb

Write this code in python or c$.$

Ready$-$made regex libraries should$$not$$be$$used$.$