
    Given a list of social media user connections where each connection is represented as a tuple of two user IDs, write a function to identify and count the number of mutual friendships in the network. A mutual friendship exists when there are two connection entries in opposite directions between the same pair of users, such as (user1, user2) and (user2, user1).
    

    
def count_bidirectional(test_list):
    """
    Given a list of social media user connections where each connection is represented as a tuple of two user IDs, write a function to identify and count the number of mutual friendships in the network. A mutual friendship exists when there are two connection entries in opposite directions between the same pair of users, such as (user1, user2) and (user2, user1).
    

    """
def count_bidirectional(test_list):
    """
    Given a list of social media user connections where each connection is represented as a tuple of two user IDs, write a function to identify and count the number of mutual friendships in the network. A mutual friendship exists when there are two connection entries in opposite directions between the same pair of users, such as (user1, user2) and (user2, user1).
    

    """
    res = 0
    for idx in range(0, len(test_list)):
        for iidx in range(idx + 1, len(test_list)):
            if test_list[iidx][0] == test_list[idx][1] and test_list[idx][1] == test_list[iidx][0]:
                res += 1
    return res