Call two strings s$1$ and s$2$ similar if$,$ for each distinct character in s$1,$ it is possible to replace all occurrences of it by another character $($possibly itself$)$ uniquely such that, after all replacements are done to s$1,$ we end up with s$2.$ For example:

The strings s$1=$ "adt" and s$2="$bst$"$ are similar, because the replacements $\text{'}$a$\text{'}->\text{'}$b$\text{'},\text{'}$d$\text{'}->\text{'}$s$\text{'}$ and $\text{'}$t$\text{'}->\text{'}$t$\text{'}$ transform s$1$ into s$2.$

The strings s$1=$ "adt" and s$2="$dcc$"$ are not similar. The only possible replacement $\text{'}$a$\text{'}->\text{'}$d$\text{'},\text{'}$d$\text{'}->\text{'}$c$\text{'}$ and $\text{'}$t$\text{'}->\text{'}$c$\text{'}$ does transform s$1$ into s$2,$ but is invalid because it violates uniqueness $($we have two characters that get replaced with $\text{'}$c$\text{'}).$

The strings s$1="$aa$"$ and s$2="$bc$"$ are not similar, because to transform s$1$ into s$2$ we need to replace $\text{'}$a$\text{'}$ with two different characters, but this is not allowed.

Note that the replacements must occur independently of each other $($i$.$e$.$ in the second example, we don't replace each $\text{'}$a$\text{'}$ by $\text{'}$d$\text{'}$ before replacing each $\text{'}$d$\text{'}$ by $\text{'}$c$\text{'},$ as the result would be that each $\text{'}$a$\text{'}$ also gets replaced by $\text{'}$c$\text{'}).$

Your task is to implement the following function in similar.c$,$ using the HashTable ADT to write an algorithm that determines if two strings are similar:

bool areSimilarStrings$($char $*$s$1,$ char $*$s$2)$;

Testing

similar.c contains a main function which allows you to test your areSimilarStrings function. It accepts two strings as command$-$line arguments which will be passed to your function. Here are some examples of its usage, and some expected outputs:

make

$...$

$./$similar adt bst

The strings are similar

$./$similar adt dcc

The strings are not similar

$./$similar aa bc

The strings are not similar