The following is how we define a linear linked list node:

struct node

{ int item; node* next;

node(int x, node* t)

{ item = x; next = t; }

};

typedef node* link;

Write a c++ function void cntDelete(link h, int k) that takes two parameters: a link to the head of a linked list L; and an integer k>0. The function deletes the kth node from L. This requires counting nodes to locate the kth node, and it deletes this node from L. It is given that L has strictly more than k nodes.

void cntDelete(link h, int k)

{