Consider a connected graph G$=($V$,$E$)$ with n vertices, The SynGHS algorithm has

Question $8$ options:

time complexity O $($n$)$ and message complexity O $(($n $+|$E$|)\backslash$log n$)$

time complexity O $($n$\backslash$log n$)$ and message complexity O $(($n $+|$E$|)\backslash$log n$)$

time complexity O $(\backslash$log n$)$ and message complexity O $(($n $+|$E$|)\backslash$log n

time complexity O $($n $)$ and message complexity O $(($n $+|$E$|))$

time complexity O $(\backslash$log$^2$ n$)$ and message complexity O $(($n $+|$E$|)\backslash$log n