Let A be the set of strings of $0$’s and $1$’s of length $3$ or less. Define the relation of $d$ on $A$ by $xdy$ if $x$ is contained within $y$. For example, $01d101$.
a) Draw a digraph for this relation.
b) Do the same for the relation $p$ defined by $xpy$ if $x$ is a prefix of $y$. For example, $10p101$, but $01p101$ is false.
I don't understand what they are asking here, all I'm asking is to help simplify the question. I hope I haven't been to vague.