Consider the following C++ code. Treat the assertions as part of the input type to each function. class A \{public: virtual AO{}}; class B : public A \{\} ; class Jeff \{. public: B* f(int n) \{ assert(n \& 2=0 ); \} return new B; \}; class Mutt \{ public: Af( int n){ return new A; \} \}; Would it be possible to declare that is a subtype of (while respecting the Liskov substitutability principle)? What about the reverse? Explain your reasoning