Given the following recursive relation for Fibonacci series $F(n)$ and its base case.

$F(n)=2F(\frac{n}{4})+n-2,F(1)=1$

$(1)$ Use recursive technique to find the running time function $T(n).[$Not mater theorem$]$

$(2)$ What is its Big$-$O$?$

$(3)$ What is the worst running time when $n$ is $1024?$