Pairs of Words
If you have pair of words A and B, you can find the shortest word C, which contain word A and B. We can accept that words contain only signs "0" & "1".

Example:
For A = 10011101 and B = 111
word C = A, because A contain word B.

In text file named dane.txt do following order. Answers to sub-punkt a,b and c place in text file named zad_5.txt. Results from sub-punkt d in text file named slowa.txt.

SUB-POINTS:
a)Give the answer, how much pairs of single words (A,B) in file dane.txt are palindroms, answer write to file zad_5.txt.

b)Give the answer, how much pairs of words (A,B) wrote in single verse in file dane.txt have property that word B is inside word A,answer write to file zad_5.txt.

c)Give the answer, how much pairs of words (A,B) wrote in single verse in file dane.txt have property that is only one way to create word C. 
You must stick word A and B to create word C.

d)For all of pairs of words (A, B) placed in next verses in file dane.txt:
• Create the shortest word C containing two words from one pair;
• Write builded by you result's words C in text file slowa.txt, every word in single verse, in order answering pairs (A, B) from file dane.txt.