🔥 Memory Management - phase 2 done

[amir-kedis]

Phase 2 done horray

• needs further testing
• implemented buddy system using a complex binary tree of memory block give it a look I wrote recursion like never before reminded me of the days of algo and ds labs

[AhmedHamed3699]

Amazing 🔥🔥
just a small refinement:
You can get highest power of 2 by getting (1 << ceil(log2(x)))
I think it will be a bit faster, looks better.
But this is not really a problem, you did a fabulous job