$///============$ PART $1$: FIXED code $==========///$

$///======$ DON'T CHANGE THIS PART $============///$

#include

#include

#define MAX$\_$WORD$\_$CHAR $100$

#define GPA "GPA"

#define DATE "DATE"

struct Date

$\{$

int year;

int month;

int day;

$\}$;

typedef struct Date Date;

struct Node

$\{$

Date dob;

float gpa;

struct Node $*$next;

$\}$;

typedef struct Node Node;

void readData$($FILE $*,$ char $**,$ float $*,$ Node $**,$ Node $**)$;

Node $*$mergeList$($Node $*,$ Node $*)$;

Node $*$filterList$($Node $*,$ char $*,$ float$)$;

Node $*$reverseList$($Node $*)$;

void printList$($Node $*)$;

int main$()$

$\{$

FILE $*$fp $=$ fopen$("$DATA$.$IN$","$r$")$;

Node $*$headL$1=$ NULL;

Node $*$headL$2=$ NULL;

char $*$controlString;

float targetGPA;

readData$($fp$,$ &controlString, &targetGPA, &headL$1,$ &headL$2)$;

printList$($headL$1)$;

printf$("$

$")$;

printList$($headL$2)$;

printf$("$

$")$;

Node $*$head $=$ mergeList$($headL$1,$ headL$2)$;

head $=$ filterList$($head$,$ controlString, targetGPA$)$;

head $=$ reverseList$($head$)$;

printList$($head$)$;

fclose$($fp$)$;

$\}$

$///============$ PART $2$: Student works $==========///$

$//$ Define supported functions here.

$//$

void readData$($FILE $*$fp$,$ char $**$controlString$,$ float $*$targetGPA$,$ Node $**$headL$1,$ Node $**$headL$2)$

$\{$

$//$ TODO: read data with file pointer fp:

$//$ LINE$1$: controlString targetGPA

$//($LT or GT$)($float number$)$

$//$ LINE$2$: headL$1$ is the head of list

$//$ LINE$3$: headL$2$ is the head of list

$\}$

Node $*$mergeList$($Node $*$headL$1,$ Node $*$headL$2)$

$\{$

$//$ TODO: add list $2$ into the end of list $1,$ return the head of result list

$\}$

Node $*$filterList$($Node $*$head$,$ char $*$controlString$,$ float targetGPA$)$

$\{$

$/*$

TODO: Filter the third list based on GPA criteria.

If controlString is $"$LT$",$ filter the students with a GPA less than targetGPA.

If controlString is $"$GT$",$ filter the students with a GPA greater than targetGPA.

return head of filtered list

$*/$

$\}$

Node $*$reverseList$($Node $*$head$)$

$\{$

$//$ TODO: reverse the list

$//$ return the new head

$\}$

void printList$($Node $*$head$)$

$\{$

$//$ TODO: print the linked list to stdout

$\}$