Explain why each is right or wrong

Identify correct (true) statements: There exist faster algorithms than "Weighted Union Find" to determine connectivity in a graph In a tree any node should have at most two branches A component in the "Weighted Union Find" is represented as a tree Union find allows for efficient deletion of connections (edges) Copying data and/or updating data several times may affect performance adversely Unbalanced trees may have linear access time