What is the NPDA for question given?


Please explain how to construct how to form NPDA of part b


The idea here is to push two 0’s into the stack for each 0, and then either pop one 0 or two 0 for each 1. if at last we are left with no symbol in the stack, then the string belongs to the given language.