Computer Science, asked by cdbhuvanesh, 3 months ago

Given a number N and three operations (divide by 3, divide by 2, subtract by 1), find the minimum number of operations to
reach 0. You can divide only if the number is multiple of divisor. [Note: greedy will be incorrect and BFS will be
exponential
Example N= 10,10-1 = 9.9/3 = 3.3-1= 2, 2/2 = 1, 1-1 = 0. Total 5 steps.​

Answers

Answered by rajni6944
3

Since polar molecules cannot be transported across the plasma membrane, carrier proteins called glucose transporters are needed for cellular uptake.

Answered by arunle191309ec
0

Answer:

rmrffjx awhile toh sghhxhkjfsZjkk

Similar questions