Exercise 17.10 Consider the tree shown in Figure 19.5. Describe the steps involved in exec...

Exercise 17.10 Consider the tree shown in Figure 19.5. Describe the steps involved in executing each of the following operations according to the tree-index concurrency control algorithm discussed in Section 19.3.2, in terms of the order in which nodes are locked, unlocked, read, and written. Be specific about the kind of lock obtained and answer each part independently of the others, always starting with the tree shown in Figure 19.5.

1. Search for data entry 40*.

2. Search for all data entries k∗ with k ≤ 40.

3. Insert data entry 62*.

Figure 17.4

4. Insert data entry 40*.

5. Insert data entries 62* and 75*.