Consider the tree shown to the right. (a) How many degrees of separation are there between Upper J and Upper Y? (b) How many degrees of separation are there between Upper R and Upper U? (c) How many degrees of separation are there between Upper X and Upper Y? (d) What is the diameter of the network? Upper JUpper K nbspUpper LUpper Mnbsp Upper NUpper OUpper Pnbsp Upper QUpper RUpper SUpper TUpper Unbsp Upper Vnbsp Upper Wnbsp Upper Xnbsp Upper Y A graph has 16 vertices labeled Upper J through Upper Y and 15 edges. The edges are as follows: Upper J Upper K, Upper J Upper L, Upper J Upper M, Upper K Upper N, Upper L Upper O, Upper M Upper P, Upper M Upper Q, Upper O Upper R, Upper O Upper S, Upper P Upper T, Upper Q Upper U, Upper S Upper V, Upper S Upper W, Upper S Upper X, Upper T Upper Y. Question content area bottom Part 1 (a) The degree of separation between Upper J and Upper Y is 4. (Type a whole number.) Part 2 (b) The degree of separation between Upper R and Upper U is 6. (Type a whole number.) Part 3 (c) The degree of separation between Upper X and Upper Y is 8. (Type a whole number.) Part 4 (d) The diameter of the network is enter your response here. (Type a whole number.)