assembly x86 Write a function that accepts a positive random number as a parameter and returns the sum of the random number's digits. Write a program that generates random numbers until the sum of the random number's digits divides the random number without remainder. assembly language

In deadlock avoidance using banker’s algorithm, what would be the consequence(s) of: (i) a process declaring its maximum need as maximum possible for each resource. in other words, if a resource a has 5 instances, then each process declares its maximum need as 5. (ii) a process declaring its minimum needs as maximum needs. for example, a process may need 2-5 instances of resource a. but it declares its maximum need as 2.