1. Analysis of algorithms. Consider the following code fragment. (11 Points) void traverse(struct Node *head) { If (head == NULL) return; while (head->next != NULL) printf("%d", head->data); head = head->next; } 3 a) What's the advantage & disadvantage of Array and Link list (6 points) b) If the list data we have is: 1,3,5,7,9. After running the function, print the list's result. (3 points) c) What's the time complexity of the traverse function (2 points)