# Prove L = L(R) based on a regular expression

I'm given the following language:

L = {w∈{0,1}* | w ends in 010 and contains 011}

The task is to find a regular expression R that describes this language and prove L = L(R).