Description of Change

In this algorithm, we are going to use Bitmasking technique to solve the famous NP-hard Traveling Salesman Problem.
As we know working with bits decreases the time complexity a little bit.
What I did is considered the nodes/cities as bits of a decimal no and traversed the whole path, Since traversing will have
redundant computations so, I used a dynamic programming memoization technique to overcome that.

Checklist

• Added description of the change
• Added file name matches File name guidelines
• Added tests and examples, test must pass
• Added documentation so that the program is self-explanatory and educational - Doxygen guidelines
• Relevant documentation/comments is changed or added
• PR title follows semantic commit guidelines
• Search previous suggestions before making a new one, as yours may be a duplicate.
• I acknowledge that all my contributions will be made under the project's license.

Notes: