For this problem I am given 4T(n/2) + 100n. I am trying to find the running time of this algorithim given different input sizes. For example, if the recurssion tree gave n^2 as big O, i would have a constant, c, multiplied by (input size)^2 / operations a second. So it would look like c*(n)^2/ 10^8 for example. My question is how exactly do we find the value for the constant c that is multiplied by n^2. Also, I would appecraite it if someone could show me the correct recurssion tree for 4T(n/2) + 100n

Thanks