Please fix the code. It is natural merge sort that uses sort method and merge method. Also it uses linked list with it's own node class as well. But it does not run. I have asked this question before but that was not natural merge sort it was just simple merge sort , so please fix this code or make very similar to that

Thanks !!

public Node Pubuo Node first public int Dubuc class Nodet int last nemodng if this this first nenodeI wouc Node sort Node head)H Node right new Node(o, muul return heedi if (heed element heed next..Lement)H right head-nextI left Left if Cleft if (right if t public Node Pubuo Node first public int Dubuc class Nodet int last nemodng if this this first nenodeI wouc Node sort Node head)H Node right new Node(o, muul return heedi if (heed element heed next..Lement)H right head-nextI left Left if Cleft if (right if t