Consider a B+ tree: The key size is 4 byte, the pointer size is 4 bytes, and the block size is 36 bytes. What is the maximum possible value of the degree d? Note: 2d - n, where n is the parameter of the B+ tree that is equal to the maximum number of key values for each block in the B+ tree. (a) 4 (b) 2 (c) 3 (d) 1