Data Structure by Java . help me quickly please ..

consider a doubly-linked list, if we need to find the index of the node that contains the maximum number. What are the missing statements? public int find Maxindex(node head) int k = 1; maxindex=1 node temp = head; int max = head.data; While (temp!= null) if (temp.data> max) [ -(1) (2) 1 temp = temp next k++ return (maxindex); } (2 Points) k++ max = head data: None of the above k = max max = tem data max = temp. maxindex=kit max = tem datamaxindex=0