Use this statement and see the picture given below!! only Question 4 i need General mathematical demonstration

N=113537407 P-1 Pollard's factorization With checking the document below : Question 1 What value of B we need to choose ? You need to give the smallest value to have at least one prime factor of n Question 2 What happen if we take B=40 and we run the algorithm ? Question 3 How can we find p with a multiple of p Question 4 xB=a^B !-1 demonstration ? NB :this is the original document in french but you can translate it Soit p un diviseur premier de n tel que les diviseurs premiers de p - 1 soient inferieurs ou egaux a un certain entier B, avec des exposants pas trop grands de sorte que l'on ait (1) B! = 0 mod. p - 1. Choisissons un entier a tel que 1