please

Infinite recursion can lead to an error known as stack fault memory exception syntax error logic error Question 25 1 pts Infinite recursion can occur because the base case is missing one of the necessary termination conditions the recursive case is imvoked with simpler arguments a second function is called from the recursive one the recursive function is called more than once Consider the code snippet below: int inain() Shape: shapesinUM_OBJECTS] shapes [0] new Circle (0,0,100,150); shapes [1] new Rectangle (200,260,50,100); shapes [2] fic new ciecle (300,50,250,250); shapes [3] now Rectande (100,350,200,150) for (1nt 1 in. 1 \& Num objtCTS; 1+6 ) 1. Shapes [i]-sarau(drais_area), for (int 10;1 i+1) detete shapes [1] In order for the loop to show different behavior when calling the function on the two different kind of objects in the array. what must be true? The drew function must be a virtual function in the base class The objects must be aggregates of each other The objects in the array should be unrelated to one another The array should contain objects, not pointers Consider the code snippet below: In order for pointers to the two different objects and to be put into the same array what must be true? The dram function must be a virtual function in the base class The objects must be aggregates of each other The objects must be related to one another via inheritance The array should contain objects, not pointers Consider the code snippet below, which uses two pre-defined classes and int main() Time* test time[SIZE]; Int rand hrs, rand mins, rand secs: Zone Type rand zone; tor ( int 1/0;(