int make_post(const User *author, User *target, char *contents) {
218         if (author == NULL || target == NULL){
219                 return 2;
220         }
221         for (int i = 0; i < MAX_FRIENDS; i++){
222                 if (author->friends[i] == target){
223                         Post *new_post = malloc(sizeof(Post));
224                         strcpy((*new_post->contents), contents);
225                         strcpy((*new_post->author), author->name);
226 
227                         time_t curtime;
228                         time(&curtime);
229                         (*new_post)->date = curtime;
230 
231                         new_post->next = target->first_post;
232                         target->first_post = &new_post;
233                         return 0;
234                 }
235         }
236         return 1;
237 }
238 

typedef struct post {  
    char author[MAX_NAME];  
    char *contents;  
    time_t *date;  
    struct post *next;  
} Post;  
Make a new post from 'author' to the 'target' user,
205  * containing the given contents, IF the users are friends.
206  *
207  * Insert the new post at the *front* of the user's list of posts.
208  *
209  * 'contents' is a pointer to heap-allocated memory - you do not need
210  * to allocate more memory to store the contents of the post.
211  *
212  * Return:
213  *   - 0 on success
214  *   - 1 if users exist but are not friends
215  *   - 2 if either User pointer is NULL