Base 2 exponential objective function

Let f(X) = x1*(2^(c/x1)-1) + x2*(2^(c/x2)-1) + x3*(2^(c/x3)-1)

The function f(X) is convex because it represents the sum of a multiple convex functions.

We want to:

minimize f(X) = x1*(2^(c/x1)-1) + x2*(2^(c/x2)-1) + x3*(2^(c/x3)-1)
subject to
0<x1<1
0<x2<1
0<x3<1
x1+x2+x3=1

How to use CVX in order to get the solution of this convex problem?

You ought to be able to use the same technique as my answer at Simple Convex Optimization

Thank you.
I understand how to solve it using such type of problem.