Let v and w be distinct vertices in kn. let pm denote the number of paths of length m from v to w in kn, 1 ? m ? n.

a) derive a recurrence relation for pm.

b) find an expicit formula for pm.

Assume a class window with accessor method getwidth that accepts no parameters and returns an integer. assume further an array of 3 window elements named winarr, has been declared and initialized. write a sequence of statements that prints out the width of the widest window in the array.