int make_friends(const char *name1, const char *name2, User *head) {
    //User *user1 = malloc(sizeof(User));
    //User *user2 = malloc(sizeof(User));
    
    User *user1 = find_user(name1, head);
    User *user2 = find_user(name2, head);
    
    User *curr;
    User **friends_list1 = user1->friends;
    User **friends_list2 = user2->friends;

    if (user1 == user2) {
        return 3;
    }

    if ( user1 == NULL || user2 == NULL) {
        return 4;
    }

    for (int i = 0; i < MAX_FRIENDS; i++) {
        if (friends_list1[i] == user2) {
            return 1;
            break;
        } else {
            curr = head;
            if (strcmp(friends_list1[i]->name,"") == 0) {
                strcpy(friends_list1[i]->name, user2->name); //seg fault here 
                //printf("%p", friends_list1[i]->name);
                break;
            }
            curr = curr->next;
        } 
        
    }
    return -1;
}
Make two users friends with each other.  This is symmetric - a pointer to each user must be stored in the 'friends' array of the other. New friends must be added in the first empty spot in the 'friends' array.
 