Costs and MC The figure to the right shows short-run cost and demand curves for a
monopolistically competitive firm in the footwear market. revenue ATC AVC P. Which of the
following statements describes the best course of action for the firm depicted in the diagram?
The firm should minimize its losses by producing o, units and charging a price of Po The firm
should exit the industry because its price is less than its average total cost The firm should
minimize its losses by producing O A. Demand O B. MA O C. Quantity , units and charging a
price of 2 The firm should minimize its losses by producing Q, units and charging a price of P1
O D. Click to select your answer
Solution
A monopolistically competitive firm maximizes profit or minimizes loss when it produce that
level of output corresponding to which MR curve intersects MC curve.
The given figure shows that MR curve is intersecting MC curve corresponding to QY level of
output.
Corresponding to this level of output, Price is P1, ATC is P2, and AVC is P0.
Since, price is less than ATC, firm is incurring a loss.
However, price is greater than AVC.
So,
Best course of action for firm in short-run is to remain in operation and minimize its losses by
producing QY units and charging a price of P1.
Hence, the correct answer is the option (D)..
Could you implement this please. I was told to use pointers as the d.pdf
1. Could you implement this please. I was told to use pointers as the data Members. Thank you .
class Set
{
public:
Set();
Set(int n);
Set(Set &set);
int get_size() const;
bool contains(int n) const;
void expand_set();
void add(int n);
Set& operator=(Set &);
void out();
virtual ~Set();
private:
int* elements;
int *size;
};
Solution
Here is the code for you:
class Set
{
public:
Set()
{
size = 50;
elements = new int(size);
for(int i = 0; i < 50; i++)
set[i] = 0;
}
Set(int n)
2. {
size = n;
elements = new int(size);
for(int i = 0; i < size; i++)
set[i] = 0;
}
Set(Set &set)
{
set.size = size;
set.elements = new int(size);
for(int i = 0; i < size; i++)
set.elements[i] = elements[i];
}
int get_size() const
{
return size;
}
bool contains(int n) const
{
for(int i = 0; i < size; i++)
if(elements[i] == n)
return true;
return false;
}
void expand_set()
{
int *temp = new int(size * 2);
for(int i = 0; i < size; i++)
temp[i] = elements[i];
elements = temp;
}
void add(int n);
Set& operator=(Set &x)
{
size = x.size;
for(int i = 0; i < size; i++)
![Could you implement this please. I was told to use pointers as the data Members. Thank you .
class Set
{
public:
Set();
Set(int n);
Set(Set &set);
int get_size() const;
bool contains(int n) const;
void expand_set();
void add(int n);
Set& operator=(Set &);
void out();
virtual ~Set();
private:
int* elements;
int *size;
};
Solution
Here is the code for you:
class Set
{
public:
Set()
{
size = 50;
elements = new int(size);
for(int i = 0; i < 50; i++)
set[i] = 0;
}
Set(int n)](https://image.slidesharecdn.com/couldyouimplementthisplease-230905013119-bf8d1d6b/85/Could-you-implement-this-please-I-was-told-to-use-pointers-as-the-d-pdf-1-320.jpg)
![{
size = n;
elements = new int(size);
for(int i = 0; i < size; i++)
set[i] = 0;
}
Set(Set &set)
{
set.size = size;
set.elements = new int(size);
for(int i = 0; i < size; i++)
set.elements[i] = elements[i];
}
int get_size() const
{
return size;
}
bool contains(int n) const
{
for(int i = 0; i < size; i++)
if(elements[i] == n)
return true;
return false;
}
void expand_set()
{
int *temp = new int(size * 2);
for(int i = 0; i < size; i++)
temp[i] = elements[i];
elements = temp;
}
void add(int n);
Set& operator=(Set &x)
{
size = x.size;
for(int i = 0; i < size; i++)](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)