Embedding spanning trees into another directed acyclic graph

Question

Please ask for clarification and allow me time to respond rather than downvoting right away, thanks.

The Algorithm

Given two directed acyclic graphs G<