Design an algorithm quick$-$find $($x$)$ where xinS,$S=\{s1,s2,$dots,$sn\}$ of all possible set

elements. Set $L=\{l1,l2,$dots,$ln\}$ is the set of all adjacency lists. Show your algorithm in the

form of pseudo code.

list $2$

$\backslash$table$[[0,$null,null$]]$

list $4$

list $5$

list $6$