Show by induction that your closed formula from (c) is the number of times that the given statement is implemented for a problem of size n.Note: if your proof is easily  a proof that you have a correct closed formula for your recurrence from (c), then you will not get anymarks for this query. Your proof must refer back to the program in order to be right. The Java code for this question: public void readRear(Scanner in)

{ListNode tmp, current; int data; int i;
n= readInteger(in);
start=null; rear=null;
for (i=0; i < n; i++)
{
data= readInteger(in);
tmp= newListNode(data, null);
if (i==0) { start=tmp; }
else
{
// Checkpoint 1.
current= start;
while (current.next != null)
{
current= current.next; // Statement to count.
// Checkpoint 2.
}
current.next= tmp;
}
rear= tmp;
}
// Checkpoint 3.
}