Given the following Binary Search Trees, perform the required rotation using trinode restructuring using four possible orientations described in your book and restructure algorithm:

$($a$)(5$ points$)($b$)(5$ points$)$

$($c$)(5$ points$)($d$)(5$ points$)$