include getopt in this code with the usage % doublesort [-d] [-o output_file_name] input_file_name: #include #include #include #include typedef struct node { char* data; struct node* prev; struct node* next; } Node; Node* create_node(char* data) { Node* new_node = malloc(sizeof(Node)); new_node->data = malloc(strlen(data) + 1); strcpy(new_node->data, data); new_node->prev = NULL; new_node->next = NULL; return new_node; } void insert_node(Node** head, Node* new_node) { if (*head == NULL) { *head = new_node; return; } Node* current_node = *head; while (current_node->next != NULL && strcmp(new_node->data, current_node->data) > 0) { current_node = current_node->next; } if (current_node->next == NULL && strcmp(new_node->data, current_node->data) > 0) { current_node->next = new_node; new_node->prev = current_node; return; } Node* prev_node = current_node->prev; if (prev_node == NULL) { *head = new_node; } else { prev_node->next = new_node; } new_node->prev = prev_node; new_node->next = current_node; current_node->prev = new_node; } void print_list(Node* head, FILE* output_file) { while (head != NULL) { fprintf(output_file, "%s\n", head->data); head = head->next; } } void convert_to_lowercase(char* string) { for (int i = 0; string[i]; i++) { string[i] = tolower(string[i]); } } int main(int argc, char* argv[]) { if (argc != 2) { printf("Usage: %s input_file\n", argv[0]); return 1; } FILE* input_file = fopen(argv[1], "r"); if (input_file == NULL) { printf("Could not open file %s\n", argv[1]); return 1; } Node* head = NULL; char buffer[100]; while (fgets(buffer, sizeof(buffer), input_file)) { char* token = strtok(buffer, " \t\n"); while (token != NULL) { convert_to_lowercase(token); Node* new_node = create_node(token); insert_node(&head, new_node); token = strtok(NULL, " \t\n"); } } fclose(input_file); print_list(head, stdout); return 0; }.

1. include getopt in this code with the usage % doublesort [-d] [-o output_file_name]
input_file_name:
#include
#include
#include
#include
typedef struct node {
char* data;
struct node* prev;
struct node* next;
} Node;
Node* create_node(char* data) {
Node* new_node = malloc(sizeof(Node));
new_node->data = malloc(strlen(data) + 1);
strcpy(new_node->data, data);
new_node->prev = NULL;
new_node->next = NULL;
return new_node;
}
void insert_node(Node** head, Node* new_node) {
if (*head == NULL) {
*head = new_node;
return;
}
Node* current_node = *head;
while (current_node->next != NULL && strcmp(new_node->data, current_node->data) > 0) {
current_node = current_node->next;
}
if (current_node->next == NULL && strcmp(new_node->data, current_node->data) > 0) {
current_node->next = new_node;

2. new_node->prev = current_node;
return;
}
Node* prev_node = current_node->prev;
if (prev_node == NULL) {
*head = new_node;
} else {
prev_node->next = new_node;
}
new_node->prev = prev_node;
new_node->next = current_node;
current_node->prev = new_node;
}
void print_list(Node* head, FILE* output_file) {
while (head != NULL) {
fprintf(output_file, "%sn", head->data);
head = head->next;
}
}
void convert_to_lowercase(char* string) {
for (int i = 0; string[i]; i++) {
string[i] = tolower(string[i]);
}
}
int main(int argc, char* argv[]) {
if (argc != 2) {
printf("Usage: %s input_filen", argv[0]);
return 1;
}
FILE* input_file = fopen(argv[1], "r");
if (input_file == NULL) {
printf("Could not open file %sn", argv[1]);

3. return 1;
}
Node* head = NULL;
char buffer[100];
while (fgets(buffer, sizeof(buffer), input_file)) {
char* token = strtok(buffer, " tn");
while (token != NULL) {
convert_to_lowercase(token);
Node* new_node = create_node(token);
insert_node(&head, new_node);
token = strtok(NULL, " tn");
}
}
fclose(input_file);
print_list(head, stdout);
return 0;
}