Suppose the CPU o which OS runs supports an atomic instruction fetch_and_increment as follows:-

Int fetch_and_increment (int *x){ Last_value = *x; *x = *x+1; Return last_value; }

Show how can use the above instructions to implement mutual exclusion. Your answer should be In two distinct parts: (i) Give a solution that achieves mutual exclusion and progress, but has starvation. (ii) Give a modified solution that also achieves bound waiting.

For each part, just show the entry section and exit section codes clearly, no explanation is needed.

Instructions:- (i) Plagiarism free (ii) Solution generated from any AI platform is strictly Prohibited (iii) Referencing style APA

Please provide solution asap, I will upvote your solution.