More Pumpability This problem extends regular Problem $2$ above by asking you to show that a few more regular languages are pumpable.

a $[6]$ Lec$1$a $=$ All binary strings with an equal number of $01$s an $10$s$.$