Heаp Questiоn 1.1 Belоw is а memоry diаgram of what the heap is laid out immediately before line A of the following program. This heap that uses the best-fit placement policy withOUT splitting and withOUT coalescing and allocb() and freeb() follow the allocator design we discussed in class. Use this memory diagram to answer the following three questions. #include struct Triplets { char a; char b; char c; }; int main(void) { // above code omitted struct Triplets *t = allocb(sizeof(struct Triplets)); // Line A if (t == NULL) { exit(1); } t->a = 'X'; t->b = 'Y'; t->c = 'Z'; freeb(t); // Line B // remaining code omitted } How many bytes of padding are needed in the memory allocation at line A?