Q$17.2\mathrm{.}3)[5$ points$]$ You have the following sequence of keys: $,$

$9,40,36,38$ to be inserted sequentially into an empty Red$-$Black tree. Answer the

following questions:

Q$17\mathrm{.}1.-$ How many double red violations did you encounter and fix while building the

tree? $[2$ point$]$

Q$17\mathrm{.}2.-$ How many trinode restructuring operations did you need to apply to fix double

red violations? Specify the types of the trinode restructuring operations and after the

insertion of which keys. $[1\mathrm{.}5$ point$]$

Q$17\mathrm{.}3.-$ How many recoloring operations did you need to apply to fix double red

violations? Specify after the insertion of which keys. $[1\mathrm{.}5$ point$]$