Construct npda's that accept the following regular languages:

$($a$)L_1=L(aa{a}^{**}$bab$).$

$($b$)L_2=L(aa{b}^{**}ab{a}^{**}).$

$($c$)$ The union of $L_1$ and $L_2.$

$($d$)L_1-L_2.$

$($e$)$ The intersection of $L_1$ and $L_2$