help to Data Structures & Algorithms plzzzzzzzzzz in java:cool:

Consider the following recurrence:

T(1) = 4

T(n) = 2T(n/2) + 5n + 3

• Evaluate the value of T(n) for n = 2, 4, 8, 16, 32

• Solve the above recurrence exactly by finding a closed form expression

for it using recursion technique.