Discrete Structure and Combinatorial Analysis

can you help me with this

q1:

Is it possible to construct a directed graph whose vertices have the following in - degrees ( from smallest to largest ) : 0,1,1,1,4 and the following out - degrees ( again , from smallest to largest ) : 0,1,2,2,2 ? Explain why or why not . If yes , also show an example of such a graph .