$(20$ points$)$ State whether the following claim is true or false and prove your answer.

Claim: For any $($non$-$empty$)$ alphabet $,$ there is no language Lsube${}^{**}$ which is both regular and inherently ambiguous.

Hint: Use a context$-$free grammar recognizing $L$ to show a contradiction if it were ambiguous.