data structure by java

1 What is the pre-order traversal of the following tree * (1 Point) Enter your answer 2 Using the Linear probing hash function what is the index of number 28 h(x) = x % table-size h'(x) = Th(x) + f0]% table-size f) = 1 where i= 0,1,2, Key space = (7,4, 16, 9,5,8, 28) (1 Point) 1 2 0 3 4 un 6 7 8 9 10 11 16 5 7 8 9