Computer Science

Provide a detailed step by step solution, including all the necessary calculations, explications, schematics necessary, as well as the correct answer for the problem.

Let the function g$($A$,$ B$,$ C$,$ D$,$ E$)$ be defined as follows:

g$($A$,$ B$,$ C$,$ D$,$ E$)=$m$(0,2,5,6,7,8,12,14,18,21,23,24,25,26,30,31)$

$+$d$(1,10,13,15,16,17,19,27,28,29)$

Design a minimal implementation in the form of a Multiplexer tree for this function, with the topology DE$-$BC$-$A$.$ Include all the procedure and draw the final schematic diagram. Explain the steps you take to arrive at the final solution. Only use multiplexers, do not use additional gates.