Processes $0$ and $1$ are executed concurrently. They share two semaphores X and Y $($each initialized to $1)$ and the integer count $($initialized to $0).$

void p$0()\{$

do $\{$

semWait $($X$)$;

semWait $($Y$)$;

count$++$;

semSignal $($X$)$;

semSignal $($Y$)$;

$\}$ while $(1)$;

$\}$

void p$1()\{$

do $\{$

semWait $($Y$)$;

semWait $($X$)$;

count$--$;

semSignal $($X$)$;

semSignal $($Y$)$;

$\}$ while $(1)$;

$\}$

Can this execution result in deadlock? If yes, give an example execution sequence that results in deadlock.

Can this execution result in starvation? If yes, give an example execution sequence that results in starvation.