(Solved): Choose the best answer. An algorithm to determine if a graph with n 3 vertices is a star is: P ...

Choose the best answer. An algorithm to determine if a graph with n ? 3 vertices is a star is: Pick any node; if its degree is 1, traverse to a neighbor node. Consider the node you end up with. If its degree is not n-1, return false, else check that all its neighbors have degree 1: if so, return true, else return false. O Pick any node; if its degree is n-1, traverse to a neighbor node. Consider the node you end up with. If its degree is not 1, return true, else check that all its neighbors have degree n-1: if so, return true, else return false. O Pick any node; if its degree is 3, traverse to a neighbor node. Consider the node you end up with. If its degree is not n-1, return false, else check that all its neighbors have degree 3: if so, return true, else return false. Pick any node; if its degree is n-3, traverse to a neighbor node. Consider the node you end up with. If its degree is not n-3, return true, else check that all its neighbors have degree 3: if so, return false, else retum true.