The following question concerns the implicit memory allocator discussed in the lectures and textbook and your lab and tests your knowledge of the implicit list data structure and boundary tag method used in that memory allocator.

The output below shows the state of the heap of the implicit allocator described in the text, lectures and implemented in your lab.

Heap $(0$x$10$ca$6$f$008)$:

$0$x$10$ca$6$f$008$: header: $[8$:a$]$ footer: $[8$:a$]$

$0$x$10$ca$6$f$010$: header: $[40$:a$]$ footer: $[40$:a$]$

$0$x$10$ca$6$f$038$: header: $[16$:f$]$ footer: $[16$:f$]$

$0$x$10$ca$6$f$048$: header: $[64$:a$]$ footer: $[64$:a$]$

$0$x$10$ca$6$f$088$: header: $[64$:a$]$ footer: $[64$:a$]$

$0$x$10$ca$6$f$0$c$8$: header: $[3912$:f$]$ footer: $[3912$:f$]$

$0$x$10$ca$70010$: EOL

This data shows the state of the implicit allocator heap after executing the following code:

char $*$p$1=$ malloc$($Answer

$)$;

char $*$p$2=$ malloc$($Answer

$)$;

char $*$p$3=$ malloc$($Answer

$)$;

free$($p$1)$;

char $*$p$4=$ malloc$($Answer

$)$;

Fill in the numeric values with the largest possible value that would result in the heap output shown above assuming that the malloc implementation