Make two strings alike.

A group played a game in a class in which one person has to give two words, and by removing unnecessary letters from them, you have to make those two words alike.

You have to count that how many unwanted letters you've deleted.

Write a function solve that have the following parameter(s):
1.) a= a string
2.) b= a string

a = qaedtg
b = qsefth
The function will return,

After removing a, d, g from a and s, f, h from b.
These words become identical.

• The length of string p and q will be greater than 1 and less than 10000.
• The string p and q will always contain lower case alphabets.