Implement random friend recommendation

Implement random_recommend(...) for a friend-recommendation system. A User has: id currentFriends: list[User] Your implementation must: Recommend only users that are not in user.currentFriends and not the user themself. Contain no duplicates (by id). Be random. (If required) Support k: return at most k users; if fewer are available, return all. (If required) Support reproducibility with seed. Typical inputs (adapt to provided skeleton): user: User all_users: list[User] optional k: int optional seed: int Output: list[User] Constraints: len(all_users) up to 1e5 Example: user.id=1, friends=[2], all=[1,2,3,4], k=2 => could return [3,4] or [4,3]. Example Input (conceptual) user.id=1,friends=[2] all=[1,2,3,4],k=2,seed=0 Output Two users from {3,4} (deterministic given seed)