kindly solve this question related theory of automata. if your solution will be right i will do upvote. thank you

Problem 1: Create an acceptor PDA with alphabet X={0,1} that accepts only the such words, where substrings "100" are no more than "010" (equal or less). It can be a table format or a graph. a) Draw the PDA. b) Is the language regular? Prove it. (Pumping lemma)