
Step 1: Understanding the problem.
The number of shifts corresponding to different numbers of patients per shift is given in the bar graph. The amount Dr. Gita earns is \(1000(X - 0.2)\), where \(X\) is the number of patients per shift. The data from the graph is as follows:
For \(X = 5\), the number of shifts is 20.
For \(X = 6\), the number of shifts is 40.
For \(X = 7\), the number of shifts is 30.
For \(X = 8\), the number of shifts is 10.
Step 2: Calculating the total earnings. For \(X = 5\): \[ \text{Earnings} = 1000 \times (5 - 0.2) \times 20 = 1000 \times 4.8 \times 20 = 96,000. \] For \(X = 6\): \[ \text{Earnings} = 1000 \times (6 - 0.2) \times 40 = 1000 \times 5.8 \times 40 = 232,000. \] For \(X = 7\): \[ \text{Earnings} = 1000 \times (7 - 0.2) \times 30 = 1000 \times 6.8 \times 30 = 204,000. \] For \(X = 8\): \[ \text{Earnings} = 1000 \times (8 - 0.2) \times 10 = 1000 \times 7.8 \times 10 = 78,000. \] Step 3: Calculating the total earnings and average earnings.
Total earnings for all 100 shifts:
\[ \text{Total Earnings} = 96,000 + 232,000 + 204,000 + 78,000 = 610,000. \] The average earnings per shift: \[ \text{Average Earnings} = \frac{610,000}{100} = 6,100. \] Thus, the average earnings per shift are ₹6,100, which corresponds to Option (A).
P and Q play chess frequently against each other. Of these matches, P has won 80% of the matches, drawn 15% of the matches, and lost 5% of the matches.
If they play 3 more matches, what is the probability of P winning exactly 2 of these 3 matches?
Consider designing a linear binary classifier \( f(x) = \text{sign}(w^T x + b), x \in \mathbb{R}^2 \) on the following training data: 
Class-2: \( \left\{ \left( \begin{array}{c} 0 \\ 0 \end{array} \right) \right\} \)
Hard-margin support vector machine (SVM) formulation is solved to obtain \( w \) and \( b \). Which of the following options is/are correct?
In the given figure, the numbers associated with the rectangle, triangle, and ellipse are 1, 2, and 3, respectively. Which one among the given options is the most appropriate combination of \( P \), \( Q \), and \( R \)?

A regular dodecagon (12-sided regular polygon) is inscribed in a circle of radius \( r \) cm as shown in the figure. The side of the dodecagon is \( d \) cm. All the triangles (numbered 1 to 12 in the figure) are used to form squares of side \( r \) cm, and each numbered triangle is used only once to form a square. The number of squares that can be formed and the number of triangles required to form each square, respectively, are:

def f(a, b):
if (a == 0):
return b
if (a % 2 == 1):
return 2 * f((a - 1) / 2, b)
return b + f(a - 1, b)
print(f(15, 10))
The value printed by the code snippet is 160 (Answer in integer).