Given the following Prolog code, answer the following questions. 1 split(.0.0.0). split(Pivot, [X∣T],[X∣Le],Gt):− X=< Pivot, split(Pivot,, , Le,Gt). split(Pivot, [X∣T],Le,[X∣Gt]):− x> Pivot, split(Pivot,T,Le,Gt). Q1. What are the size-n problems? Q2. What is the stopping condition? Q3. At Line 1, what will happen if we substitute P for the underscore "_"? Q4. What is the size of size-m problem? Q5. Which lines need to be changed if we want to sort by descending order?