What is the worst case time complexity of inserting n² elements into an AVL-tree with n elements initially?

What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintained in sorted order?

Consider a double hashing scheme in which the primary hash function is
h₁(k)=k mod 23, and the secondary hash function is h₂(k)=1+(k mod 19).
Assume that the table size is 23. Then the address returned by probe 1 in the probe sequence (assume that the probe sequence begins at probe 0) for key value k=90 is _______.

Consider the following C program.

#include < stdio.h >
int main () {
    int a [4] [5] = {{1, 2, 3, 4, 5},
                           {6, 7, 8, 9, 10},
                           {11, 12, 13, 14, 15},
                           {16, 17, 18, 19, 20}};
    printf (“%d\n”, *(*(a+**a+2) +3));
    return (0);
}

The output of the program is _______.