If L$1$ is regular and L$2$ is a finite language $($i$.$e$.,$ a language with a finite number of strings$),$ then L$1$ union L$2$ must be a regular language

Group of answer choices

True

False