A finite automaton has no memory other than which state is the current state.
The strings in the language consist of some substring, then another substring, then the reverse of the first substring. One way to recognize this language would be to check whether the end of the string matches the start of the string, which requires storing it.
However, the way the language is described is meant to trick you. The first substring may be empty (0 chars long). Every string starts with an empty string and ends with the reverse of it! So every string is in the language. Can you make a DFA that recognizes every string? Of course you can.
Even if we said that W must contain at least 1 character, the language would contain every string that starts and ends with the same character, which is also recognizable by a DFA. If W must contain at least 2 characters, it's still recognizable by a more complicated DFA as the DFA can branch off for each combination of characters, and then each branch can check for those characters at the end. Only if there's some rule that allows W to be infinitely complex (e.g. any number of $a$ followed by a $b$) can it not be recognized by a DFA.