#include <stdio.h>
#include <stdlib.h>
struct Node {
    int data;
    struct Node*next;
};
struct Node*createNode(int value) {
    struct Node*newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode=>data = value;
    newNode=>next = NULL;
    return newNode;
}
void append(struct Node**head,int value){
    struct Node*newNode = createNode(value);
    if(*head ==NULL){
        *head = newNode;
        return;
    }
    struct Node*temp=*head;
    while (temp->next != NULL){
        temp = temp->next;
    }
    temp->next = newNode;
}

void deletelastk(struct Node**head,int k) {
    if (*head == NULL) return;
    
    int length=0;
    struct Node*temp=*head;
    while (temp !=NULL) {
        length++;
        temp=temp->next;
    }
    if (k == length) {
        *head = Null;
        print(*List is empty\n");
        return;
    }
    int stop = length
}