I need it fast

the rest of the program

} Question 3 (40 point): Give the output of the following program and draw the double circular linked list. struct node{ struct node *left; char letter; struct node *right; }; typedef struct node *NODEPTR; NODEPTR getnode(void); void list_info(NODEPTR); main() { NODEPTR P , list, save; char one; p=getnode(); p->letter='A'; list=p; p->right=p; p->left=p; save=list; for(int i=2;1letter=one; p->left-save; save->right-p; save-p; } list->left=save; save->right=list; list=p; list_info(list); } NODEPTR getnode() { NODEPTR 9; q = (NODEPTR) malloc(sizeof(struct node)); return(a); } void list_info(NODEPTR list) { NODEPTR save; save=list; do{ printf("%c ", save->letter); save= save->right; } while (save!=list)