Self Doubt on language acceptance

Question

$L= {WW^RX| W,X=(a+b)^+}$  

My question was why can’t this be regular??

Consider below regular expression

$aa(a+b)^+ + ab(a+b)^+ +ba(a+b)^+ + bb(a+b)^+$==>$(aa+ab+ba+bb)(a+b)^+$ wont this language generate all strings of L as we do for $WXW^R$

Comments

@Hemanth_13, the regular expression which have you written it can accept so many other string which doesn't in the language like babab,abaab... etc so many string are there.

and for $WXW^{r}$ you can define regular expression like starting and ending with same symbol and in between everything x can eat up.

$a(a+b)^{+}a + b(a+b)^{+}b$

---

@Shubhgupta 

bbaba--> W=b X=aba => $WW^RX$=bbaba similary for aabab W=a and X=bab.

but abab is a language where my logic failed.

---

yes i did mistake string like ababa, babab, babba, abaab... these will be the right example.