Can someone explain how to find the time complexity for this function? Thank you!

Int F( int n)

{ S=0;

for (int i= 1; i<=n; i++)

S=S +i;

If n(== 1) return S;

return F(n/2) + F(n/2) + F(n/2) + S;

}