Data structures @ JAVA

do the algorithm in part a with heap please

Q1 (15 pts] A kindergarten teacher wants to represent a list of her students' records (by their ID). For each child we would like to mark whether he is a boy or a girl. Suggest a data structure that supports the following operations in O(log n) time in the worst case, where n is the number of students (boys and girls) in the data structure when the operation is executed: Using algorithms: 1. Explain what data structure you would use, extra fields added to your data structure. 2. Explain how each of the above operations will be executed (write algorithms explaining their time complexity). a. Insert (SID,G) function - Insert a new student s with student ID (SID) and gender (G) b. ChangeGender(k) - Change the student with SID = k to be a boy. C. Find Diff(k) function, Find the difference between the number of girls and the number of boys ( #of girls - #of boys 1) among all the students with SID smaller than k