$//$can someone look at my code and make sure it is correct maybe even ad a h$.$ file

#include

#include

#include

#include

#include

#include

using namespace std;

$//$ Function to check if two words are anagrams

bool areAnagrams$($const string& word$1,$ const string& word$2)\{$

if $($word$1.$length$()!=$ word$2.$length$())$ return false;

string sorted$1=$ word$1$;

string sorted$2=$ word$2$;

sort$($sorted$1.$begin$(),$ sorted$1.$end$())$;

sort$($sorted$2.$begin$(),$ sorted$2.$end$())$;

return sorted$1==$ sorted$2$;

$\}$

$//$ Function to check if one word can be obtained by swapping adjacent letters

bool canTransformBySwapping$($const string& word$1,$ const string& word$2)\{$

if $($word$1.$length$()!=$ word$2.$length$())$ return false;

for $($size$\_$t i $=0$; i $$ word$1.$length$()-1$; $++$i$)\{$

string temp $=$ word$1$;

swap$($temp$[$i$],$ temp$[$i $+1])$;

if $($temp $==$ word$2)$ return true;

$\}$

return false;

$\}$

$//$ Function to produce a proof sequence using BFS

vector produceProofSequence$($const string& start, const string& target$)\{$

if $($start $==$ target$)$ return $\{$start$\}$;

unordered$\_$set visited;

queue$>>$ q;

q$.$push$(\{$start$,\{$start$\}\})$;

visited.insert$($start$)$;

while $(!$q$.$empty$())\{$

auto $[$current$,$ sequence$]=$ q$.$front$()$;

q$.$pop$()$;

for $($size$\_$t i $=0$; i $$ current.length$()-1$; $++$i$)\{$

string next $=$ current;

swap$($next$[$i$],$ next$[$i $+1])$;

if $($visited$.$find$($next$)==$ visited.end$())\{$

vector nextSequence $=$ sequence;

nextSequence.push$\_$back$($next$)$;

if $($next $==$ target$)$ return nextSequence;

q$.$push$(\{$next$,$ nextSequence$\})$;

visited.insert$($next$)$;

$\}$

$\}$

$\}$

return $\{\}$; $//$ return empty vector if no sequence is found

$\}$

int main$()\{$

string word$1,$ word$2$;

cout $$ "Enter the first word: $"$;

cin $>>$ word$1$;

cout $$ "Enter the second word: $"$;

cin $>>$ word$2$;

if $(!$areAnagrams$($word$1,$ word$2))\{$

cout $$ "The words are not anagrams. Transformation is not possible.

$"$;

$\}$ else $\{$

vector proofSequence $=$ produceProofSequence$($word$1,$ word$2)$;

if $(!$proofSequence.empty$())\{$

cout $$ "Transformation is possible. Proof sequence:

$"$;

for $($const string& word : proofSequence$)\{$

cout $$ word ;

$\}$

cout

$"$;

$\}$ else $\{$

cout $$ "Transformation is not possible by swapping adjacent letters.

$"$;

$\}$

$\}$

return $0$;

$\}$