Given the following program, what, if anything should be done?

#include

#include

#include

#include

using namespace std;

mutex mtx$1,$mtx$2$;

void john$()\{$

for $($auto i: $\{1,2,3\})\{$

mtx$1.$lock$()$;

this$\_$thread::sleep$\_$for$($chrono::milliseconds$(301))$;

mtx$2.$lock$()$;

cout $<<$ "John has the locks" $<<$ endl;

mtx$2.$unlock$()$;

mtx$1.$unlock$()$;

$\}$

$\}$

void jane$()\{$

for $($auto i: $\{1,2,3\})\{$

mtx$2.$lock$()$;

this$\_$thread::sleep$\_$for$($chrono::milliseconds$(300))$;

mtx$1.$lock$()$;

cout $<<$ "Jane has the locks" $<<$ endl;

mtx$1.$unlock$()$;

mtx$2.$unlock$()$;

$\}$

$\}$

int main$()\{$

auto t$1=$ thread$($john$)$;

auto t$2=$ thread$($jane$)$;

t$1.$join$()$;

t$2.$join$()$;

$\}$

Group of answer choices

void jane$()\{$

for $($auto i: $\{1,2,3\})\{$

mtx$1.$lock$()$;

cout $<<$ "Jane has the lock" $<<$ endl;

mtx$1.$unlock$()$;

$\}$

$\}$

$//$ NEVER USE TWO MUTEXES together, so remove mtx$2$

void jane$()\{$

for $($auto i: $\{1,2,3\})\{$

lock $($mtx$1,$ mtx$2)$;

cout $<<$ "Jane has the locks" $<<$ endl;

$\}$

$\}$

$//($Because lock$()$ automatically unlocks when it goes out of scope.$)$

void jane$()\{$

for $($auto i: $\{1,2,3\})\{$

mtx$1.$lock$($mtx$2)$;

cout $<<$ "Jane has the locks" $<<$ endl;

mtx$2.$unlock$()$;

mtx$1.$unlock$()$;

$\}$

$\}$

$//($Because mtx$1$ will not lock until it locks mtx$2)$

void jane$()\{$

for $($auto i: $\{1,2,3\})\{$

lock $($mtx$1,$ mtx$2)$;

cout $<<$ "Jane has the locks" $<<$ endl;

mtx$2.$unlock$()$;

mtx$1.$unlock$()$;

$\}$

$\}$

$//($Because lock$()$ does not acquire the locks until it can get both.$)$