finite automata – Thinking about how an automaton can be created that accepts a language that switches the first and second alphabet

I have been thinking about this problem for quite a while, but to no avail.

Say I have a deterministic automaton M (you can assume it to be the 5-tuple (Q, sigma, q0, delta, F), which is given to accept a language L.

How do we create an automaton that would accept the language that has the first and second letter of the language L switched (given that the first and second letter in fact exist in a string accepted by M).

Is there an easy way to do this?