5. Complete the following program: Hinelude using namespace std; struct node \{ int key: node *nextil; int main(Int argc, char* argv[1) \{ if (arge > 2 ) i int 1 , N = Nto1 ( argv [ 1 ]) , M = atos ( argv [ 2 ]) ; node t , x ; t = new node; t > k ey = 1 ; x = t for ( 1 = 2 ; 1 <= N ; 1 + + ) { t > next = new nodie; t = t n e x t : t k ey = 1 ; / ANSWER HERE return 0 ; a. t n next = x ; b. x = t ; c. t x ; d. t = E x ;.