Whenever you're ready, walk me through how you'd approach this.
Design and implement a solution for a dynamic connectivity problem where users can become friends or break connections, and queries determine if two users are still connected.
Assume operations arrive as a finite sequence containing add-friend, remove-friend, and connectivity-query operations. Return query results efficiently, treat friendships as undirected, and explain the data structure, complexity, duplicate operations, invalid removals, and persistence strategy.