Please give clear explanation with necessary diagrams and steps for the question

Define the bit-flip operator as follows: For individual bits, define 0=1 and 1=0. For any string s=01n{0,1}, define s=01n, where i=i For any language L{0,1}, define L={ssL} Prove the following claim: Claim. The set of regular languages is closed under the bit-flip operator. Remember that this is a proof, not just a proof sketch. So don't be too vague or sloppy. (Hint: In other words, you need to prove that for any regular language L,L is also regular.)