Question $2$: $(10\backslash \%)$ Relational Algebra

A small university that practices team teaching has an enrolment system whose database includes the following tables

student $($name$,$ email, major, id$)$

course $($code$,$ title, credits, days, time,room$)$

enrol $($code$,$ id$)--$ both referencing the other tables

teach $($code$,$ prof$)$

Let's say Prof. Murray wants a list of all her students $($enrolled in one or more of her courses$),$ with name, email, and major.

Draw a Relational Algebra tree that will produce this result. The "leaves" should be relations $($tables$)$ at the bottom, and operations should lead to the single result at the top, a set of tuples $($name$,$ email, major$)$

You can use $\backslash (\backslash$bowtie $\backslash )$ for $($natural$)$ join of $2$ tables.

$($That$\text{'}$s right, we crazy computer scientists draw trees upside down.$)$