$3)$ The following functions are related to algorithm Quick$-$union, Fill in the blank with the appropriate option? $(7)$ private int find$($int p$)$Find component name.while $($p $!=$ id$($p$])$ p $=$ id$($p$]$;return p:$?$public void union$($int p$,$ int q$)\{$ Give p and q the same root.int pRoot $=$ find $($p$)$;int qRoot $=$ find$($q$)$;if $($pRoot $==$ qRoot$)$ return;count$-.$a$)$ qRoot$=$id$[$pRoot$]$b$)$ id$($pRoot$]=$ qRoot;c$)$ id$[$qRoot$]=$ pRoot;d$)$ pRoot$=$id$[$qRoot$]$