Suppose you have a relation containing the x, y coordinates and names of restaurants. Suppose also that the only queries that will be asked are of the following form: The query specifies a point, and asks if there is a restaurant exactly at that point. Which type of index would be preferable, R-tree or B-tree? Why?

Ithink the answer is slide show

You start out as beginner, then you will reach hand with 100 points, 250 for ambitious, 500 points + 5 brainliest for virtuoso, 1000 and 10 for expert, 3000 and 15 for ace, and 15000 and 50 for genius. it stops there. 

You will use _power option to create an urgent presentation using predesigned and preinstalled elements.

(java)3. the answer is  (c): x[2] = 12; if x is an array with three elements, the first element has index 0. the second index has index 1. the third and final element has index 2.4. the answer is (d) for (int y : x) { system.out.println (y) ; }this is an example of syntax  of a "for-each loop."for each element in the integer array x, use y to indicate the current element to do some code with it.the other choice, (c) for (int x : y) { system.out.println (y) ; }. in a for-each loop, the variable to the right of the colon is the array variable; the one to the left is the control variable.choices (a) and (b) have invalid syntax.5. the answer is (a)  int x = {1, 2, 3, 5, 10}; you need to indicate that it is an array using []. without using [], you are trying to assign an array to an integer. you need to use int[] to indicate integer array.so choice (a) has incorrect syntax.