
There are 12 plots, each receiving an even number of plots. The possible distributions are 4, 4, 2, 2 or 6, 2, 2, 2.
From the 4, 4, 2, 2 distribution:

Consequently, the number of trees in Z1 = 69 - 30 - 28 - 8 = 3.
The final table looks like this:
so the correct option is (B) : 98.
There are 12 plots, each receiving an even number of plots. The possible distributions are 4, 4, 2, 2 or 6, 2, 2, 2.
From the 4, 4, 2, 2 distribution:
Therefore:


The number of trees received by Abha, Bina, Chitra, and Dipti is 50, 69, 30, and 56, respectively.
So the correct option is (A): 50, 69, 30, 56.
There are 12 plots, each receiving an even number of plots. The possible distributions are 4, 4, 2, 2 or 6, 2, 2, 2.
In the 4, 4, 2, 2 distribution:

Thus, the highest number of trees must be in D's plot, and it is 32. Therefore, the number of trees in X3 and X4 are 32 and 24, in any order.
The number of trees in X2 = 98 - 56 - 12 = 30. Therefore, the number of trees in Z1 = 69 - 30 - 28 - 8 = 3.
The final table will look like this:
Number of Pine trees received by Chitra = 18.
So, the correct option is (C): 18.
There are 12 plots, each receiving an even number of plots. The possible distributions are 4, 4, 2, 2 or 6, 2, 2, 2.
From the 4, 4, 2, 2 distribution:
From the 6, 2, 2, 2 distribution:
From the 8-plot distribution:
According to point 7:
Among the remaining plots Y2, Y3, Y4, and Z3:
Let the number of trees in Y4 be 4x. From point 3, the number of trees in Y3 and Y2 will be 2x and x, respectively.
Therefore:
The table now looks like this:

Each plot had trees in non-zero multiples of 3 or 4, and none of the plots had the same number of trees. According to point 2, B didn't have the largest number of trees in any plot, meaning x<8.
π₯x cannot be 7, 5, 3, 2, or 1 because, for these values, at least one of x, 2x, or 4x is not a multiple of 3 or 4. Therefore, π₯x can be either 6 or 4.
If π₯=6x=6:
If x=4:
From point 1, the number of trees with C and D are 30 and 56, respectively. Therefore, the number of trees in Z2 = 18. Thus, the number of trees with B = 205 - 50 - 30 - 56 = 69.
From point 2, the largest number of trees in a plot is 32. This number could be in either B's or D's plot:
The number of trees in X2 = 98 - 56 - 12 = 30. Therefore, the number of trees in Z1 = 69 - 30 - 28 - 8 = 3.
The final table will look like this:

So, the Number of trees per plot is least for Bina=3
So, the correct option is (D): Bina, 3 trees.
There are 12 plots, each receiving an even number of plots. The possible distributions are 4, 4, 2, 2 or 6, 2, 2, 2.
From the 4, 4, 2, 2 distribution:
From the 6, 2, 2, 2 distribution:
From the 8-plot distribution:
According to point 7:
Among the remaining plots Y2, Y3, Y4, and Z3:
Let the number of trees in Y4 be 4x. From point 3, the number of trees in Y3 and Y2 will be 2x and x, respectively.
Therefore:
The table now looks like this:

Each plot had trees in non-zero multiples of 3 or 4, and none of the plots had the same number of trees. According to point 2, B didn't have the largest number of trees in any plot, meaning x<8.
π₯x cannot be 7, 5, 3, 2, or 1 because, for these values, at least one of x, 2x, or 4x is not a multiple of 3 or 4. Therefore, x can be either 6 or 4.
If x=6:
If x=4:
From point 1, the number of trees with C and D are 30 and 56, respectively. Therefore, the number of trees in Z2 = 18. Thus, the number of trees with B = 205 - 50 - 30 - 56 = 69.
From point 2, the largest number of trees in a plot is 32. This number could be in either B's or D's plot:
The number of trees in X2 = 98 - 56 - 12 = 30. Therefore, the number of trees in Z1 = 69 - 30 - 28 - 8 = 3.
The final table will look like this:

So, Bina got 28 pine trees
So, the correct option is (B): Bina got 32 pine trees.
There are 12 plots, each receiving an even number of plots. The possible distributions are 4, 4, 2, 2 or 6, 2, 2, 2.
From the 4, 4, 2, 2 distribution:
From the 6, 2, 2, 2 distribution:
From the 8-plot distribution:
According to point 7:
Among the remaining plots Y2, Y3, Y4, and Z3:
Let the number of trees in Y4 be 4x. From point 3, the number of trees in Y3 and Y2 will be 2x and x, respectively.
Therefore:
The table now looks like this:

Each plot had trees in non-zero multiples of 3 or 4, and none of the plots had the same number of trees. According to point 2, B didn't have the largest number of trees in any plot, meaning x<8.
x cannot be 7, 5, 3, 2, or 1 because, for these values, at least one of x, 2x, or 4x is not a multiple of 3 or 4. Therefore, x can be either 6 or 4.
If x=6:
If x=4:
From point 1, the number of trees with C and D are 30 and 56, respectively. Therefore, the number of trees in Z2 = 18. Thus, the number of trees with B = 205-50-30-56=69.
From point 2, the largest number of trees in a plot is 32. This number could be in either B's or D's plot:
The number of trees in X2 = 98 - 56 - 12 = 30. Therefore, the number of trees in Z1 = 69-30-28-8=3.
The final table will look like this:

So, column 1,2,3,4 have 36,52,49,68 the highest number of trees.
So, the correct option is (D): 4
A train travels from Station A to Station E, passing through stations B, C, and D, in that order. The train has a seating capacity of 200. A ticket may be booked from any station to any other station ahead on the route, but not to any earlier station. A ticket from one station to another reserves one seat on every intermediate segment of the route. For example, a ticket from B to E reserves a seat in the intermediate segments Bβ C, Cβ D, and DβE. The occupancy factor for a segment is the total number of seats reserved in the segment as a percentage of the seating capacity. The total number of seats reserved for any segment cannot exceed 200. The following information is known. 1. Segment Cβ D had an occupancy factor of 952. Exactly 40 tickets were booked from B to C and 30 tickets were booked from B to E. 3. Among the seats reserved on segment Dβ E, exactly four-sevenths were from stations before C. 4. The number of tickets booked from A to C was equal to that booked from A to E, and it was higher than that from B to E. 5. No tickets were booked from A to B, from B to D and from D to E. 6. The number of tickets booked for any segment was a multiple of 10.