I came across a problem that is asking me to show that if a directed graph possesses a directed Euler Cycle, then it must be a strongly connected graph.

I know that a directed graph that is strongly connected it has paths from x-y and y-x and that a Euler Cycle is a cycle that traverses all edges and visitseach vertex atleast once. How can i combine these to show the question up top is true? If anyone can shed light on where i can begin that would be very helpful. Thanks