Ok see ,if it accept 101 and having no loop then this language becomes finite language that means its surely regular language , coming back to your second question it may not satisfy Pumping Lema property because Pumping Lema use for proving non regularity always use in negative sense , means if some language satisfy its property then language is not regular but if not satisfy its property we can't say anything about language .