Given an inner Node class that implements a class with Hashmap, write the moveToFront method.

==============================================================================================================

class KVNode implements LinkedMapInterface.Entry {

private KVNode prev; private KVNode next; private KInner key; private VInner value;

/** * Node constructor no parameters */ public KVNode() { this(null, null); }

/** * Node constructor with key, value * * @param key * input key * @param value * input value */ public KVNode(KInner key, VInner value) { this.key = key; this.value = value; }

/** * link with the next node * * @param nextNode * node to be linked */ private void linkWith(KVNode nextNode) { this.next = nextNode; nextNode.prev = this; }

/** * insert after the current node * * @param current * node to be insert after */ private void insertAfter(KVNode current) { KVNode tmp = current.next; current.linkWith(this); linkWith(tmp); size++; }

/** * Moves this node to the front of the list. * */ @Override @SuppressWarnings("unchecked") public void moveToFront() {

}

/** * Removes this node from the list * */ @Override public void remove() { prev.linkWith(next); size--; }

/** * Returns key in this node * * @return key in this node */ @Override public KInner getKey() { return key; }

/** * Returns value in this node * * @return value in the current node */ @Override public VInner getValue() { return value; } }