1st part: these languages are not finite since you can have any number of programs written in these languages,
2nd part: No doubt in this , because once the language is finite you can construct Finite automata such that all the strings present in the language are accepted ,here we don't care about the number states as long as it is finite.
3rd part: No all regular language are not finite for instance take the example of L={an | n>=0},L={anbm| n,m>=0}, is a regular language which is finite.