Let p = Tu where w is the solution of the optimization problem defined by Eqn. 7.6 with the contraints given by Eqn. 7.5 on page 328 in the Bishop's Pattern Recognition and Machine Learning book. Note that p is the margin for the maximum-margin hyperplane. Show that p is given by = 2L(a), (1) where L(a) is defined by (7.10) on page 329 in the Bishop's Pattern Recognition and Machine Learning book