In the following code example,

A$.$ Does a deadlock guaranteed to occur every time? Answer Y or N$.$

B$.$ Is this an example of a circular wait? Answer Y or N$.$

C$.$ Is there a cycle in the resource$-$allocation graph for the following program? Answer Y or N $.$

D$.$ Which line is violating the ordering, thus creating the possibility of a deadlock? Enter the line number.

E$.$ The program will be deadlock$-$free if line and line

$```$

$/*$ thread one runs in this function $*/$

void $*$do work one$($void $*$param$)$

$\{$

pthread mutex lock$($&first mutex$)$;

pthread mutex lock$($&second mutex$)$;

$/**$

$*$ Do some work

$*/$

pthread mutex unlock$($&second mutex$)$;

pthread mutex unlock$($&first mutex$)$;

pthread exit$(0)$;

$\}$

$/*$ thread two runs in this function $*/$

void $*$do work two$($void $*$param$)$

$\{$

pthread mutex lock$($&second mutex$)$;

pthread mutex lock$($&first mutex$)$;

$/**$

$*$ Do some work

$*/$

pthread mutex unlock$($&first mutex$)$;

pthread mutex unlock$($&second mutex$)$;

pthread exit$(0)$;

$\}$

$```$