I realy need your help for this ,so if you please try your best.

Start off with a single slot of size 8 units at address 0, and use upper and lower bounds
of U=3,L=0.
There are three processes queued up waiting for slots:
Process A of size 0.7 units and duration 1 minute
Process B of size 2.4 units and duration 3 minutes
Process C of size 0.6 units and duration 1.2 minutes
Show the state of memory and the lists of holes immediately after Process A has terminated, and calculate the percentage fragmentation at that time.

With my best wishes
Thanks