int make_post(const User *author, User *target, char *contents) {
    if(author == NULL || target == NULL){
        printf("Returning 2\n");
        return 2;
    }

    //We only check in one list because we assume that make_friends works properly
    int flag = 0;
    for(int i=0; i<MAX_FRIENDS; i++){
        if ((author->friends[i] != NULL) && (author->friends[i]->name == target->name)){
            flag = 1;
        }
    }
    if(flag != 1){    //if flag == 1, then they are friends. So we return if != 1.
        return 1;
    }

    Post *newpost = malloc(sizeof(Post));
    strcpy(newpost->author, author->name);
    newpost->contents = contents;

    time_t creation_time = time(NULL);
    *(newpost->date ) = creation_time;

    newpost->next = target->first_post;
    target->first_post = newpost;


    return 0;

}
Make a new post from 'author' to the 'target' user,
 * containing the given contents, IF the users are friends.
 *
 * Insert the new post at the *front* of the user's list of posts.
 *
 * 'contents' is a pointer to heap-allocated memory - you do not need
 * to allocate more memory to store the contents of the post.
 *
 * Return:
 *   - 0 on success
 *   - 1 if users exist but are not friends
 *   - 2 if either User pointer is NULL