Assume there is an initial $1$MB memory free and the memory is allocated using the buddy system. Note that the smaller block of memory once released will coalesce into bigger blocks wherever it fits the coalescing policy of buddy system.

$1.$ Request $100$K $($A$),$ then $240$K $($B$)$ and $64$K $($C$)($illustrated already$)$

$2.$ Request $200$K $($D$)$

$3.$ Request $50$K $($E$)$

$4.$ Request $140$k $($F$)$

$5.$ Release E

$6.$ Release C

$7.$ Release F

How many partitions will it have at the end of step $7?($used and unused$)$