5. The uniform-cost search algorithm with tree-like search is used to solve a state-space search problem. There are six actions defined with action costs equal to 0.5, 0.6, 1.3, 1.2, 2.3 and 2.5. It is known that the optimal solution has a path cost of 8.0. Determine an upper-bound value for the size of the search tree (i.e., total number of nodes generated.)