my ID is odd

You will construct and answer this question according to your student ID. Assume that you will store citizen records in a B+ Tree. Find the minimum OR maximum height of this B Tree according to the following formula: a.) If your ID is an odd number find the minimum height otherwise find the maximum height of the tree. b-) Assume that you have (Your student ID's last (rightmost] two digits * 10 million) records. C-) Assume that you have 5-byte pointers if your ID is odd, 10-byte pointers if your ID is even. d-) Assume that the key size of your record is the sum of first and last two digits of your ID) bytes. e.) Assume that the record size of your question is (last (rightmost] two digits * 512) bytes. f.) Assume that the block size of your question is the first [leftmost] two digits) MB For example, if your ID is "10 07 06 013" then you will solve the question according to the given parameters below: a.) The given ID is an odd number, this means you must find the minimum height of the B+ Tree. b-) The given ID ends with 13, this means you have (13* 10 million =) 130 million records. c.) The given ID is an odd number, this means you will use 5 byte pointers, d-) Key size is 10 +13 - 23 bytes. e) Record size is 13*512 - 6656 bytes. f-) Block size is 10 MB. You will construct and answer this question according to your student ID. Assume that you will store citizen records in a B+ Tree. Find the minimum OR maximum height of this B Tree according to the following formula: a.) If your ID is an odd number find the minimum height otherwise find the maximum height of the tree. b-) Assume that you have (Your student ID's last (rightmost] two digits * 10 million) records. C-) Assume that you have 5-byte pointers if your ID is odd, 10-byte pointers if your ID is even. d-) Assume that the key size of your record is the sum of first and last two digits of your ID) bytes. e.) Assume that the record size of your question is (last (rightmost] two digits * 512) bytes. f.) Assume that the block size of your question is the first [leftmost] two digits) MB For example, if your ID is "10 07 06 013" then you will solve the question according to the given parameters below: a.) The given ID is an odd number, this means you must find the minimum height of the B+ Tree. b-) The given ID ends with 13, this means you have (13* 10 million =) 130 million records. c.) The given ID is an odd number, this means you will use 5 byte pointers, d-) Key size is 10 +13 - 23 bytes. e) Record size is 13*512 - 6656 bytes. f-) Block size is 10 MB