$[10$ Points$]$ Give an algorithm to find all nodes less than some value $x,$ in a binary heap. Your algorithm should run in $O(K),$ where $K$ is number of nodes output.

Given the array below representing disjoint sets, draw the associated trees

$[5$ points$]$

$\backslash$table$[[0,1,2,3,4,5,6,7],[-1,2,-1,-1,3,3,5,6]]$