Social Network Clusters

You are tasked with analyzing a social network represented as an undirected graph. Each user is a node, and each friendship is an edge connecting two nodes. Write a program to find the number of connected components (clusters) in the graph. Input format: The first line contains two integers, n and m (1 <= n <= 100, 0 <= m <= 1000) representing the number of users and the number of friendships. The next m lines each contain two integers u and v (1 <= u, v <= n), representing a friendship between user u and user v. Output the number of connected components in the graph. Example: Input: 4 2 1 2 2 3 Output: 2