L1 requires only one comparission at a time ===>CFL, due to Ambiguity it is Non-Deterministic CFL
L2 requires two comparissions at a time ===> CSL
There are two possibilities
1) m>=n 2) n=p
For 1) first push a then pop 1 a for each b. Since m>=n so it might happen that there are still some a's left after all b's are exhausted.
For the remaining c's we don't need to do anything
For 2) Do nothing when we get a and push all b's and pop each b for each c.